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 16:22Josu San MartinJosu San MartinScore: 29,896Success
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 16:2329,880157,274,902145,304,0001,111,0002,113,536
2Aug 2, 2026 16:2329,884157,241,532145,291,0001,142,0002,113,536
3Aug 2, 2026 16:2329,892157,202,342145,346,0001,128,0002,113,536
4Aug 2, 2026 16:2329,896156,535,744145,368,0001,124,0002,113,536
5Aug 2, 2026 16:2329,896156,645,590145,353,0001,141,0002,113,536
6Aug 2, 2026 16:2329,897157,323,741145,369,0001,131,0002,113,536
7Aug 2, 2026 16:2329,904157,338,847145,404,0001,127,0002,113,536
8Aug 2, 2026 16:2329,913156,607,895145,450,0001,127,0002,113,536
9Aug 2, 2026 16:2329,921156,579,595145,495,0001,121,0002,113,536