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 17:55Josu San MartinJosu San MartinScore: 53,954Success
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 17:5653,942275,238,269263,192,0001,127,0002,113,536
2Jul 31, 2026 17:5653,943274,451,069263,215,0001,110,0002,113,536
3Jul 31, 2026 17:5653,951274,512,109263,246,0001,117,0002,113,536
4Jul 31, 2026 17:5653,952275,250,415263,250,0001,119,0002,113,536
5Jul 31, 2026 17:5653,954275,304,625263,264,0001,115,0002,113,536
6Jul 31, 2026 17:5653,961275,309,259263,278,0001,131,0002,113,536
7Jul 31, 2026 17:5653,996276,899,477263,446,0001,138,0002,113,536
8Jul 31, 2026 17:5654,007274,710,353263,517,0001,120,0002,113,536
9Jul 31, 2026 17:5654,010275,510,771263,513,0001,140,0002,113,536