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 4, 2026 12:49Josu San MartinJosu San MartinScore: 25,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 12:5025,341132,524,563122,911,0001,263,0002,113,536
2Aug 4, 2026 12:5025,369132,676,741123,055,0001,256,0002,113,536
3Aug 4, 2026 12:5025,370132,602,538123,051,0001,263,0002,113,536
4Aug 4, 2026 12:5025,391132,745,612123,393,0001,026,0002,113,536
5Aug 4, 2026 12:5025,404133,535,787123,222,0001,261,0002,113,536
6Aug 4, 2026 12:5025,414132,805,287123,522,0001,011,0002,113,536
7Aug 4, 2026 12:5025,428132,984,776123,342,0001,258,0002,113,536
8Aug 4, 2026 12:5025,441133,056,819123,411,0001,250,0002,113,536
9Aug 4, 2026 12:5025,477133,138,432123,590,0001,252,0002,113,536