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 listAug 3, 2026 23:35Josu San MartinJosu San MartinScore: 31,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 23:3631,668163,565,829154,167,0001,009,0002,113,536
2Aug 3, 2026 23:3631,726163,640,711154,269,0001,189,0002,113,536
3Aug 3, 2026 23:3631,760164,158,059154,355,0001,273,0002,113,536
4Aug 3, 2026 23:3631,767164,101,399154,468,0001,194,0002,113,536
5Aug 3, 2026 23:3631,772164,174,179154,651,0001,036,0002,113,536
6Aug 3, 2026 23:3631,791164,895,114154,507,0001,273,0002,113,536
7Aug 3, 2026 23:3631,974165,129,711155,405,0001,271,0002,113,536
8Aug 3, 2026 23:3631,976165,120,434155,427,0001,257,0002,113,536
9Aug 3, 2026 23:3637,268191,058,812181,611,0001,007,0002,113,536