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 listAug 27, 2026 20:06flavio87flavio87Score: 26,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 20:0726,904140,219,664130,732,0001,101,0002,113,536
2Aug 27, 2026 20:0726,910140,187,832130,753,0001,107,0002,113,536
3Aug 27, 2026 20:0726,919140,253,643130,811,0001,093,0002,113,536
4Aug 27, 2026 20:0726,937140,450,261130,875,0001,118,0002,113,536
5Aug 27, 2026 20:0726,937141,243,586130,892,0001,100,0002,113,536
6Aug 27, 2026 20:0726,966141,706,623130,951,0001,185,0002,113,536
7Aug 27, 2026 20:0727,235141,812,889132,425,0001,028,0002,113,536
8Aug 27, 2026 20:0727,896145,213,950135,588,0001,103,0002,113,536
9Aug 27, 2026 20:0728,526148,759,512138,666,0001,115,0002,113,536