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 16:18Victor MerckléVictor MerckléScore: 48,898Success
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:2448,855247,118,688237,193,0002,201,0002,117,632stderr
2Jul 3, 2026 16:2448,860247,362,196237,384,0002,031,0002,117,632stderr
3Jul 3, 2026 16:2448,871247,126,853237,459,0002,010,0002,117,632stderr
4Jul 3, 2026 16:2448,895247,455,126237,512,0002,076,0002,117,632stderr
5Jul 3, 2026 16:2448,898247,384,210237,580,0002,024,0002,117,632stderr
6Jul 3, 2026 16:2448,908247,344,767237,637,0002,015,0002,117,632stderr
7Jul 3, 2026 16:2448,931247,532,685237,751,0002,015,0002,117,632stderr
8Jul 3, 2026 16:2448,939247,523,803237,708,0002,095,0002,117,632stderr
9Jul 3, 2026 16:2448,995247,857,225237,914,0002,163,0002,117,632stderr