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 15:56Victor MerckléVictor MerckléScore: 51,580Success
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 16:0651,475260,502,667250,219,0002,013,0002,117,632stderr
2Jul 3, 2026 16:0651,501261,842,535250,336,0002,023,0002,117,632stderr
3Jul 3, 2026 16:0651,504260,279,386250,347,0002,026,0002,117,632stderr
4Jul 3, 2026 16:0651,571260,685,999250,649,0002,051,0002,117,632stderr
5Jul 3, 2026 16:0651,580260,664,890250,699,0002,045,0002,117,632stderr
6Jul 3, 2026 16:0651,581260,707,894250,716,0002,031,0002,117,632stderr
7Jul 3, 2026 16:0651,586260,692,906250,697,0002,078,0002,117,632stderr
8Jul 3, 2026 16:0651,597260,748,343250,737,0002,091,0002,117,632stderr
9Jul 3, 2026 16:0655,863281,684,269271,656,0002,074,0002,117,632stderr