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:56Josu San MartinJosu San MartinScore: 61,426Success
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:5761,387311,057,795298,610,0002,190,0002,113,536
2Jul 31, 2026 14:5761,407311,126,130298,891,0002,006,0002,113,536
3Jul 31, 2026 14:5761,422311,109,015298,937,0002,034,0002,113,536
4Jul 31, 2026 14:5761,425311,158,575298,954,0002,032,0002,113,536
5Jul 31, 2026 14:5761,426311,232,217298,899,0002,089,0002,113,536
6Jul 31, 2026 14:5761,464311,346,894298,972,0002,206,0002,113,536
7Jul 31, 2026 14:5761,486311,367,547299,243,0002,043,0002,113,536
8Jul 31, 2026 14:5761,520311,703,445299,203,0002,246,0002,113,536
9Jul 31, 2026 14:5761,570311,782,668299,619,0002,078,0002,113,536