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 3, 2026 14:37Victor MerckléVictor MerckléScore: 49,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 14:3749,152248,756,801239,842,0001,006,0002,117,632stderr
2Jul 3, 2026 14:3749,229249,225,018239,209,0002,014,0002,117,632stderr
3Jul 3, 2026 14:3749,242249,191,297239,258,0002,028,0002,117,632stderr
4Jul 3, 2026 14:3749,247249,314,116239,304,0002,008,0002,117,632stderr
5Jul 3, 2026 14:3749,277249,379,792239,448,0002,014,0002,117,632stderr
6Jul 3, 2026 14:3749,280249,460,977239,434,0002,040,0002,117,632stderr
7Jul 3, 2026 14:3749,322249,612,868239,638,0002,040,0002,117,632stderr
8Jul 3, 2026 14:3749,397249,989,833240,013,0002,033,0002,117,632stderr
9Jul 3, 2026 14:3749,618251,099,425241,093,0002,039,0002,117,632stderr