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 19, 2026 18:33Victor MerckléVictor MerckléScore: 52,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 18:3452,351264,579,191254,334,0002,187,0002,113,536
2Jun 19, 2026 18:3452,427264,483,481254,826,0002,068,0002,113,536
3Jun 19, 2026 18:3452,430264,586,876254,807,0002,104,0002,113,536
4Jun 19, 2026 18:3452,447264,460,448254,945,0002,049,0002,113,536
5Jun 19, 2026 18:3452,487264,869,358255,017,0002,170,0002,113,536
6Jun 19, 2026 18:3452,513265,010,949255,145,0002,171,0002,113,536
7Jun 19, 2026 18:3452,661265,737,044255,866,0002,174,0002,113,536
8Jun 19, 2026 18:3452,845266,511,985256,733,0002,208,0002,113,536
9Jun 19, 2026 18:3453,105267,901,483258,185,0002,031,0002,113,536