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 listJun 30, 2026 14:12Victor MerckléVictor MerckléScore: 51,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:1351,040257,922,721248,077,0002,022,0002,117,632stderr
2Jun 30, 2026 14:1351,049257,984,092248,033,0002,110,0002,117,632stderr
3Jun 30, 2026 14:1351,061258,124,087248,095,0002,107,0002,117,632stderr
4Jun 30, 2026 14:1351,124258,369,371248,477,0002,032,0002,117,632stderr
5Jun 30, 2026 14:1351,129258,478,822248,457,0002,079,0002,117,632stderr
6Jun 30, 2026 14:1351,139258,399,696248,523,0002,059,0002,117,632stderr
7Jun 30, 2026 14:1351,180259,049,610248,752,0002,031,0002,117,632stderr
8Jun 30, 2026 14:1351,205258,542,553248,896,0002,011,0002,117,632stderr
9Jun 30, 2026 14:1351,686262,703,499251,218,0002,045,0002,117,632stderr