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 7, 2026 16:34Victor MerckléVictor MerckléScore: 31,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 16:3531,647162,901,588153,054,0002,018,0002,117,632stderr
2Jul 7, 2026 16:3531,669163,241,223153,156,0002,025,0002,117,632stderr
3Jul 7, 2026 16:3531,689163,415,951154,267,0001,011,0002,117,632stderr
4Jul 7, 2026 16:3531,743163,449,377153,520,0002,021,0002,117,632stderr
5Jul 7, 2026 16:3531,869164,036,218155,149,0001,013,0002,117,632stderr
6Jul 7, 2026 16:3531,920164,236,984154,390,0002,018,0002,117,632stderr
7Jul 7, 2026 16:3531,992164,589,498155,754,0001,011,0002,117,632stderr
8Jul 7, 2026 16:3532,036164,824,931154,967,0002,011,0002,117,632stderr
9Jul 7, 2026 16:3532,058164,970,011156,068,0001,018,0002,117,632stderr