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 8, 2026 15:10Victor MerckléVictor MerckléScore: 31,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 15:1131,720163,335,637154,421,0001,010,0002,117,632stderr
2Jul 8, 2026 15:1131,743163,400,729154,533,0001,012,0002,117,632stderr
3Jul 8, 2026 15:1131,777163,798,484154,698,0001,012,0002,117,632stderr
4Jul 8, 2026 15:1131,808165,265,338154,856,0001,008,0002,117,632stderr
5Jul 8, 2026 15:1131,839164,101,786154,999,0001,014,0002,117,632stderr
6Jul 8, 2026 15:1131,900164,377,739155,301,0001,010,0002,117,632stderr
7Jul 8, 2026 15:1131,947164,420,746155,533,0001,011,0002,117,632stderr
8Jul 8, 2026 15:1132,131165,264,058156,432,0001,011,0002,117,632stderr
9Jul 8, 2026 15:1132,333166,346,620157,424,0001,011,0002,117,632stderr