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 9, 2026 22:58Victor MerckléVictor MerckléScore: 30,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:5929,911154,683,916145,556,0001,009,0002,117,632stderr
2Jul 9, 2026 22:5930,082155,475,637145,381,0002,022,0002,117,632stderr
3Jul 9, 2026 22:5930,086155,355,235146,416,0001,010,0002,117,632stderr
4Jul 9, 2026 22:5930,107155,562,219146,516,0001,010,0002,117,632stderr
5Jul 9, 2026 22:5930,128155,704,581145,616,0002,012,0002,117,632stderr
6Jul 9, 2026 22:5930,138155,800,782145,647,0002,031,0002,117,632stderr
7Jul 9, 2026 22:5930,150155,843,698145,733,0002,005,0002,117,632stderr
8Jul 9, 2026 22:5930,180156,001,506146,877,0001,008,0002,117,632stderr
9Jul 9, 2026 22:5930,185155,833,970146,901,0001,009,0002,117,632stderr