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 listSep 25, 2026 16:58Andrew EpsteinAndrew EpsteinScore: 176,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 16:59176,315874,394,574862,832,0001,112,0002,117,632stderr
2Sep 25, 2026 16:59176,387874,832,694863,172,0001,125,0002,117,632stderr
3Sep 25, 2026 16:59176,432875,747,731863,416,0001,104,0002,117,632stderr
4Sep 25, 2026 16:59176,447875,867,377863,482,0001,111,0002,117,632stderr
5Sep 25, 2026 16:59176,570875,731,690864,088,0001,109,0002,117,632stderr
6Sep 25, 2026 16:59178,026882,837,650871,205,0001,127,0002,117,632stderr
7Sep 25, 2026 16:59178,305884,225,971872,588,0001,109,0002,117,632stderr
8Sep 25, 2026 16:59178,927888,106,925874,596,0002,148,0002,117,632stderr
9Sep 25, 2026 16:59180,015892,648,444880,957,0001,118,0002,117,632stderr