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 2, 2026 22:10Josu San MartinJosu San MartinScore: 29,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 22:1029,602155,027,903143,921,0001,131,0002,113,536
2Aug 2, 2026 22:1029,605155,111,154143,950,0001,118,0002,113,536
3Aug 2, 2026 22:1029,612155,118,207143,974,0001,129,0002,113,536
4Aug 2, 2026 22:1029,615155,127,664143,984,0001,131,0002,113,536
5Aug 2, 2026 22:1029,634155,205,100144,072,0001,136,0002,113,536
6Aug 2, 2026 22:1029,635155,361,553144,092,0001,122,0002,113,536
7Aug 2, 2026 22:1029,654155,285,468144,205,0001,103,0002,113,536
8Aug 2, 2026 22:1030,937161,591,081150,462,0001,130,0002,113,536
9Aug 2, 2026 22:1032,233168,033,335156,816,0001,126,0002,113,536