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 listJan 22, 2026 03:33Josu San MartinJosu San MartinScore: 114,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 03:33113,681586,867,754556,037,0001,000,0002,359,296
2Jan 22, 2026 03:33113,763582,952,180556,442,000998,0002,269,184
3Jan 22, 2026 03:33113,773584,445,052553,494,0003,996,0002,269,184
4Jan 22, 2026 03:33113,797584,263,418556,606,000999,0002,269,184
5Jan 22, 2026 03:33114,039586,911,316557,794,000999,0002,269,184
6Jan 22, 2026 03:33114,066581,802,854556,922,0001,999,0002,269,184
7Jan 22, 2026 03:33114,081584,738,550554,996,0003,999,0002,269,184
8Jan 22, 2026 03:33114,108583,102,498557,130,0002,000,0002,269,184
9Jan 22, 2026 03:33114,131590,182,436559,244,00002,363,392