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 9, 2026 22:53Victor MerckléVictor MerckléScore: 31,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:5431,095160,322,722151,358,0001,008,0002,117,632stderr
2Jul 9, 2026 22:5431,150160,679,679151,626,0001,010,0002,117,632stderr
3Jul 9, 2026 22:5431,232161,096,470152,026,0001,011,0002,117,632stderr
4Jul 9, 2026 22:5431,233160,983,197152,036,0001,008,0002,117,632stderr
5Jul 9, 2026 22:5431,289161,253,384152,307,0001,012,0002,117,632stderr
6Jul 9, 2026 22:5431,298161,302,802152,354,0001,011,0002,117,632stderr
7Jul 9, 2026 22:5431,373161,617,307152,720,0001,008,0002,117,632stderr
8Jul 9, 2026 22:5431,537162,647,716153,524,0001,010,0002,117,632stderr
9Jul 9, 2026 22:5431,818164,248,324154,898,0001,012,0002,117,632stderr