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 03:11Josu San MartinJosu San MartinScore: 27,758Success
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 03:1227,711144,893,206134,522,0001,264,0002,113,536
2Aug 4, 2026 03:1227,715144,256,275134,723,0001,082,0002,113,536
3Aug 4, 2026 03:1227,745144,456,841134,680,0001,272,0002,113,536
4Aug 4, 2026 03:1227,747144,414,067134,790,0001,173,0002,113,536
5Aug 4, 2026 03:1227,758144,546,401134,824,0001,192,0002,113,536
6Aug 4, 2026 03:1227,767144,467,513134,869,0001,191,0002,113,536
7Aug 4, 2026 03:1227,782144,568,637134,885,0001,249,0002,113,536
8Aug 4, 2026 03:1227,890145,161,031135,389,0001,275,0002,113,536
9Aug 4, 2026 03:1228,521148,202,540138,495,0001,260,0002,113,536