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 1, 2026 19:45Victor MerckléVictor MerckléScore: 111,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 19:46111,461554,033,994544,029,0002,134,0002,117,632stderr
2Jul 1, 2026 19:46111,520554,519,342544,275,0002,174,0002,117,632stderr
3Jul 1, 2026 19:46111,602554,816,645544,682,0002,168,0002,117,632stderr
4Jul 1, 2026 19:46111,617554,846,650544,766,0002,159,0002,117,632stderr
5Jul 1, 2026 19:46111,631554,912,484544,872,0002,120,0002,117,632stderr
6Jul 1, 2026 19:46111,706555,605,247545,238,0002,126,0002,117,632stderr
7Jul 1, 2026 19:46111,859556,050,986545,984,0002,126,0002,117,632stderr
8Jul 1, 2026 19:46111,930556,483,375546,311,0002,148,0002,117,632stderr
9Jul 1, 2026 19:46114,809570,459,571560,414,0002,152,0002,117,632stderr