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 05:23Josu San MartinJosu San MartinScore: 31,594Success
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 05:2331,541163,540,498153,286,0001,269,0002,113,536
2Aug 3, 2026 05:2331,564163,164,355153,408,0001,259,0002,113,536
3Aug 3, 2026 05:2331,570163,131,949153,434,0001,261,0002,113,536
4Aug 3, 2026 05:2331,581163,876,103153,478,0001,269,0002,113,536
5Aug 3, 2026 05:2331,594163,280,418153,534,0001,277,0002,113,536
6Aug 3, 2026 05:2331,872165,290,588154,909,0001,265,0002,113,536
7Aug 3, 2026 05:2331,961165,712,935155,343,0001,269,0002,113,536
8Aug 3, 2026 05:2332,068166,067,649155,870,0001,268,0002,113,536
9Aug 3, 2026 05:2332,240166,407,285156,717,0001,261,0002,113,536