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 2, 2026 15:25Josu San MartinJosu San MartinScore: 39,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:2539,653204,401,147193,203,0001,101,0002,113,536
2Aug 2, 2026 15:2539,655205,235,674193,187,0001,123,0002,113,536
3Aug 2, 2026 15:2539,661204,318,111193,225,0001,116,0002,113,536
4Aug 2, 2026 15:2539,667205,173,671193,252,0001,119,0002,113,536
5Aug 2, 2026 15:2539,681207,963,453193,305,0001,132,0002,113,536
6Aug 2, 2026 15:2539,696204,516,736193,395,0001,120,0002,113,536
7Aug 2, 2026 15:2539,696205,309,643193,380,0001,132,0002,113,536
8Aug 2, 2026 15:2539,773205,720,890192,758,0002,134,0002,113,536
9Aug 2, 2026 15:2540,112206,653,687195,435,0001,117,0002,113,536