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:13Josu San MartinJosu San MartinScore: 56,590Success
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:1356,560287,182,713276,041,0001,103,0002,113,536
2Jul 31, 2026 17:1356,569288,174,249276,057,0001,133,0002,113,536
3Jul 31, 2026 17:1356,574288,048,580276,086,0001,127,0002,113,536
4Jul 31, 2026 17:1356,574288,023,059276,102,0001,113,0002,113,536
5Jul 31, 2026 17:1356,590287,419,577276,182,0001,111,0002,113,536
6Jul 31, 2026 17:1356,623287,713,659276,325,0001,128,0002,113,536
7Jul 31, 2026 17:1356,632290,208,446276,388,0001,109,0002,113,536
8Jul 31, 2026 17:1356,790288,634,699277,142,0001,133,0002,113,536
9Jul 31, 2026 17:1356,799288,527,863277,210,0001,109,0002,113,536