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 listJul 31, 2026 14:34Josu San MartinJosu San MartinScore: 92,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 14:3592,080461,274,986449,070,0002,122,0002,113,536
2Jul 31, 2026 14:3592,183461,841,977449,693,0002,008,0002,113,536
3Jul 31, 2026 14:3592,187461,784,143449,603,0002,117,0002,113,536
4Jul 31, 2026 14:3592,426463,007,437450,660,0002,232,0002,113,536
5Jul 31, 2026 14:3592,428462,999,532450,727,0002,173,0002,113,536
6Jul 31, 2026 14:3592,438463,047,827450,942,0002,007,0002,113,536
7Jul 31, 2026 14:3593,898470,324,916457,822,0002,283,0002,113,536
8Jul 31, 2026 14:3593,929470,317,214458,119,0002,137,0002,113,536
9Jul 31, 2026 14:3594,183471,573,824459,254,0002,246,0002,113,536