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 4, 2026 14:58Victor MerckléVictor MerckléScore: 47,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:5946,858237,612,627227,570,0002,037,0002,117,632stderr
2Jul 4, 2026 14:5946,858237,569,269228,602,0001,007,0002,117,632stderr
3Jul 4, 2026 14:5946,943237,981,309227,961,0002,063,0002,117,632stderr
4Jul 4, 2026 14:5947,015238,701,810228,343,0002,034,0002,117,632stderr
5Jul 4, 2026 14:5947,050238,512,756228,539,0002,006,0002,117,632stderr
6Jul 4, 2026 14:5947,075238,604,843228,655,0002,016,0002,117,632stderr
7Jul 4, 2026 14:5947,279239,424,266229,662,0002,006,0002,117,632stderr
8Jul 4, 2026 14:5947,614241,396,822231,276,0002,033,0002,117,632stderr
9Jul 4, 2026 14:5947,716241,800,388231,778,0002,034,0002,117,632stderr