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 listApr 5, 2026 22:08limanjun99limanjun99Score: 107,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2026 22:08106,827548,276,135521,456,0001,997,0002,293,760
2Apr 5, 2026 22:08107,021550,244,379522,407,0001,997,0002,293,760
3Apr 5, 2026 22:08107,361552,066,002523,069,0003,000,0002,293,760
4Apr 5, 2026 22:08107,387551,857,611523,196,0003,001,0002,293,760
5Apr 5, 2026 22:08107,435553,207,785525,430,0001,000,0002,269,184
6Apr 5, 2026 22:08107,471550,165,377524,612,0001,998,0002,367,488
7Apr 5, 2026 22:08108,585554,886,983529,066,0003,000,0002,293,760
8Apr 5, 2026 22:08110,776570,999,074539,805,0002,998,0002,523,136
9Apr 5, 2026 22:08110,933576,795,394539,574,0003,996,0002,289,664