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 21:32Josu San MartinJosu San MartinScore: 38,627Success
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 21:3238,606200,127,980188,057,0001,115,0002,113,536
2Jul 31, 2026 21:3238,611200,169,092188,081,0001,115,0002,113,536
3Jul 31, 2026 21:3238,616200,744,969188,103,0001,118,0002,113,536
4Jul 31, 2026 21:3238,620200,074,444188,117,0001,124,0002,113,536
5Jul 31, 2026 21:3238,627200,199,354188,151,0001,125,0002,113,536
6Jul 31, 2026 21:3238,634199,433,517188,192,0001,116,0002,113,536
7Jul 31, 2026 21:3238,637199,430,851188,204,0001,120,0002,113,536
8Jul 31, 2026 21:3239,095201,787,313190,467,0001,102,0002,113,536
9Jul 31, 2026 21:3241,928215,614,458204,335,0001,115,0002,113,536