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 00:43Victor MerckléVictor MerckléScore: 47,226Success
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 00:4447,176238,985,761229,140,0002,027,0002,117,632stderr
2Jul 4, 2026 00:4447,186239,234,293229,197,0002,017,0002,117,632stderr
3Jul 4, 2026 00:4447,213241,354,455229,238,0002,109,0002,117,632stderr
4Jul 4, 2026 00:4447,214239,742,295229,315,0002,034,0002,117,632stderr
5Jul 4, 2026 00:4447,226239,197,186229,372,0002,039,0002,117,632stderr
6Jul 4, 2026 00:4447,256239,505,657229,527,0002,030,0002,117,632stderr
7Jul 4, 2026 00:4447,272239,627,046229,609,0002,027,0002,117,632stderr
8Jul 4, 2026 00:4447,282239,843,027229,654,0002,028,0002,117,632stderr
9Jul 4, 2026 00:4449,144248,805,675238,783,0002,023,0002,117,632stderr