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 listMar 15, 2026 11:51Dominique GarmierDominique GarmierScore: 194,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 09:29194,074982,703,864948,968,0001,997,0002,273,280
2Mar 15, 2026 11:51194,102976,392,313949,101,0001,998,0002,400,256
3Mar 16, 2026 09:29194,108980,437,280949,130,0001,998,0002,273,280
4Mar 15, 2026 11:51194,184978,763,794950,503,000999,0002,273,280
5Mar 16, 2026 09:29194,198977,591,164950,570,000999,0002,273,280
6Mar 15, 2026 11:51194,344979,360,115952,285,00002,269,184