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 19:20Victor MerckléVictor MerckléScore: 52,748Success
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 19:2052,700266,209,921257,225,0001,006,0002,117,632stderr
2Jul 3, 2026 19:2052,721266,275,040256,292,0002,042,0002,117,632stderr
3Jul 3, 2026 19:2052,742266,423,453256,374,0002,066,0002,117,632stderr
4Jul 3, 2026 19:2052,746266,436,386256,424,0002,034,0002,117,632stderr
5Jul 3, 2026 19:2052,748266,412,056257,461,0001,006,0002,117,632stderr
6Jul 3, 2026 19:2052,779266,935,966256,599,0002,022,0002,117,632stderr
7Jul 3, 2026 19:2052,786266,590,053256,642,0002,011,0002,117,632stderr
8Jul 3, 2026 19:2052,792267,296,858256,630,0002,051,0002,117,632stderr
9Jul 3, 2026 19:2052,822266,942,732256,722,0002,107,0002,117,632stderr