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 07:49Josu San MartinJosu San MartinScore: 26,127Success
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 07:5026,049136,739,025126,636,0001,006,0002,113,536
2Aug 4, 2026 07:5026,065136,299,200126,709,0001,012,0002,113,536
3Aug 4, 2026 07:5026,076136,296,697126,498,0001,277,0002,113,536
4Aug 4, 2026 07:5026,103137,601,317126,650,0001,259,0002,113,536
5Aug 4, 2026 07:5026,127136,377,429126,762,0001,262,0002,113,536
6Aug 4, 2026 07:5026,151136,810,862126,887,0001,254,0002,113,536
7Aug 4, 2026 07:5026,179137,392,311127,015,0001,264,0002,113,536
8Aug 4, 2026 07:5026,356137,584,394127,873,0001,274,0002,113,536
9Aug 4, 2026 07:5027,834145,482,531135,120,0001,269,0002,113,536