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 1, 2026 00:17Victor MerckléVictor MerckléScore: 51,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 00:1851,038257,819,447247,994,0002,095,0002,117,632stderr
2Jul 1, 2026 00:1851,101258,176,352248,248,0002,150,0002,117,632stderr
3Jul 1, 2026 00:1851,119258,155,933248,440,0002,046,0002,117,632stderr
4Jul 1, 2026 00:1851,156258,398,657248,580,0002,089,0002,117,632stderr
5Jul 1, 2026 00:1851,212258,635,222248,842,0002,101,0002,117,632stderr
6Jul 1, 2026 00:1851,256258,825,740249,091,0002,066,0002,117,632stderr
7Jul 1, 2026 00:1851,262258,893,733249,104,0002,084,0002,117,632stderr
8Jul 1, 2026 00:1851,761261,602,963251,502,0002,131,0002,117,632stderr
9Jul 1, 2026 00:1851,824261,607,909251,857,0002,083,0002,117,632stderr