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 listMay 17, 2026 04:58M-RochatM-RochatScore: 122,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 05:00122,077608,995,295597,078,0001,103,0002,113,536
2May 17, 2026 05:00122,098607,217,224597,142,0001,142,0002,113,536
3May 17, 2026 05:00122,299609,084,470598,190,0001,079,0002,113,536
4May 17, 2026 05:00122,372610,441,498598,620,0001,007,0002,113,536
5May 17, 2026 05:00122,496611,323,811599,230,0001,003,0002,113,536
6May 17, 2026 05:00122,632609,769,549599,896,0001,001,0002,113,536
7May 17, 2026 05:00122,691611,847,694600,107,0001,081,0002,113,536
8May 17, 2026 05:00123,343613,211,179603,256,0001,127,0002,113,536
9May 17, 2026 05:00124,888621,350,378610,779,0001,176,0002,113,536