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 listSep 2, 2026 11:48Victor MerckléVictor MerckléScore: 26,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 11:4926,951140,585,077130,969,0001,094,0002,117,632stderr
2Sep 2, 2026 11:4926,977140,671,429131,093,0001,097,0002,117,632stderr
3Sep 2, 2026 11:4926,978140,764,551131,089,0001,107,0002,117,632stderr
4Sep 2, 2026 11:4926,979140,601,947131,095,0001,106,0002,117,632stderr
5Sep 2, 2026 11:4926,981140,747,814131,107,0001,101,0002,117,632stderr
6Sep 2, 2026 11:4926,982140,676,844131,126,0001,088,0002,117,632stderr
7Sep 2, 2026 11:4926,990140,731,765131,164,0001,088,0002,117,632stderr
8Sep 2, 2026 11:4926,995140,700,032131,183,0001,094,0002,117,632stderr
9Sep 2, 2026 11:4927,010141,455,340131,254,0001,099,0002,117,632stderr