Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listOct 12, 2026 20:59Karthik ReddyKarthik ReddyScore: 23,856Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:5923,822125,661,698115,655,0001,073,00020,480
2Oct 12, 2026 20:5923,834125,714,714115,733,0001,054,00020,480
3Oct 12, 2026 20:5923,850125,787,808115,813,0001,056,00020,480
4Oct 12, 2026 20:5923,850125,787,715115,812,0001,055,00020,480
5Oct 12, 2026 20:5923,856125,849,159115,832,0001,067,00020,480
6Oct 12, 2026 20:5923,868125,845,732115,886,0001,069,00020,480
7Oct 12, 2026 20:5923,869125,915,137115,901,0001,060,00020,480
8Oct 12, 2026 20:5923,878125,949,610115,920,0001,085,00020,480
9Oct 12, 2026 20:5923,901126,049,999116,030,0001,085,00020,480