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 13:05Josu San MartinJosu San MartinScore: 30,528Success
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 13:0530,265156,821,321147,120,0001,181,0002,113,536
2Aug 4, 2026 13:0530,345157,171,045147,503,0001,188,0002,113,536
3Aug 4, 2026 13:0530,472158,377,793148,110,0001,204,0002,113,536
4Aug 4, 2026 13:0530,514157,915,043148,332,0001,190,0002,113,536
5Aug 4, 2026 13:0530,528158,712,382148,398,0001,193,0002,113,536
6Aug 4, 2026 13:0530,558158,781,657148,708,0001,031,0002,113,536
7Aug 4, 2026 13:0530,569158,187,034148,595,0001,195,0002,113,536
8Aug 4, 2026 13:0530,635158,692,180148,934,0001,179,0002,113,536
9Aug 4, 2026 13:0530,661158,755,497149,053,0001,189,0002,113,536