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 4, 2026 14:56Josu San MartinJosu San MartinScore: 25,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 14:5625,353132,639,540122,969,0001,264,0002,113,536
2Aug 4, 2026 14:5625,401133,451,887123,203,0001,266,0002,113,536
3Aug 4, 2026 14:5625,404133,565,488123,228,0001,254,0002,113,536
4Aug 4, 2026 14:5625,445133,055,828123,414,0001,268,0002,113,536
5Aug 4, 2026 14:5625,450133,058,366123,439,0001,269,0002,113,536
6Aug 4, 2026 14:5625,454133,093,678123,474,0001,251,0002,113,536
7Aug 4, 2026 14:5625,475133,179,309123,562,0001,267,0002,113,536
8Aug 4, 2026 14:5625,685136,325,408124,594,0001,264,0002,113,536
9Aug 4, 2026 14:5626,518138,920,669128,936,0001,005,0002,113,536