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 10:20Victor MerckléVictor MerckléScore: 31,554Success
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 10:2031,329161,432,476152,505,0001,010,0002,117,632stderr
2Jul 8, 2026 10:2031,348161,493,118152,597,0001,009,0002,117,632stderr
3Jul 8, 2026 10:2031,408161,779,914152,890,0001,011,0002,117,632stderr
4Jul 8, 2026 10:2031,452161,959,824153,110,0001,009,0002,117,632stderr
5Jul 8, 2026 10:2031,554162,692,517153,610,0001,009,0002,117,632stderr
6Jul 8, 2026 10:2031,607162,787,344153,867,0001,011,0002,117,632stderr
7Jul 8, 2026 10:2031,626162,844,566153,960,0001,008,0002,117,632stderr
8Jul 8, 2026 10:2031,648163,224,093154,066,0001,010,0002,117,632stderr
9Jul 8, 2026 10:2031,845163,918,225153,996,0002,047,0002,117,632stderr