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 listMay 12, 2026 20:21Victor MerckléVictor MerckléScore: 154,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 20:22154,395765,021,783754,501,0002,036,0002,113,536
2May 12, 2026 20:22154,399763,639,086754,472,0002,087,0002,113,536
3May 12, 2026 20:22154,400764,683,314755,562,0001,002,0002,113,536
4May 12, 2026 20:22154,401763,791,760754,525,0002,040,0002,113,536
5May 12, 2026 20:22154,406764,644,391754,511,0002,081,0002,113,536
6May 12, 2026 20:22154,413765,638,064754,529,0002,099,0002,113,536
7May 12, 2026 20:22154,417767,849,444754,629,0002,018,0002,113,536
8May 12, 2026 20:22154,424763,919,229754,648,0002,031,0002,113,536
9May 12, 2026 20:22154,427763,912,605754,571,0002,126,0002,113,536