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 18:02Josu San MartinJosu San MartinScore: 28,756Success
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 18:0628,679150,294,837138,490,0002,041,0002,174,976
2Aug 3, 2026 18:0628,682150,292,941138,471,0002,071,0002,174,976
3Aug 3, 2026 18:0628,694150,451,138138,465,0002,137,0002,174,976
4Aug 3, 2026 18:0628,750150,670,782138,856,0002,023,0002,129,920
5Aug 3, 2026 18:0628,756150,644,256138,814,0002,091,0002,174,976
6Aug 3, 2026 18:0628,767150,753,819138,935,0002,024,0002,129,920
7Aug 3, 2026 18:0628,911151,535,572139,636,0002,031,0002,129,920
8Aug 3, 2026 18:0628,983158,415,818139,963,0002,058,0002,129,920
9Aug 3, 2026 18:0633,326173,091,811161,270,0002,030,0002,129,920