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 24, 2026 14:13Andrew EpsteinAndrew EpsteinScore: 49,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 14:1449,725254,099,487242,546,0001,109,0002,113,536
2Sep 24, 2026 14:1449,757254,209,603242,689,0001,125,0002,113,536
3Sep 24, 2026 14:1449,761254,990,149242,716,0001,117,0002,113,536
4Sep 24, 2026 14:1449,766255,168,101242,740,0001,116,0002,113,536
5Sep 24, 2026 14:1449,772255,133,589242,763,0001,124,0002,113,536
6Sep 24, 2026 14:1449,937255,101,357243,569,0001,126,0002,113,536
7Sep 24, 2026 14:1450,126256,748,325244,505,0001,117,0002,113,536
8Sep 24, 2026 14:1450,148256,263,664244,604,0001,125,0002,113,536
9Sep 24, 2026 14:1450,178257,240,042244,747,0001,129,0002,113,536