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 06:43Josu San MartinJosu San MartinScore: 29,214Success
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 06:4329,190152,070,975141,770,0001,264,0002,113,536
2Aug 3, 2026 06:4329,199152,204,780141,805,0001,274,0002,113,536
3Aug 3, 2026 06:4329,200152,418,859142,070,0001,011,0002,113,536
4Aug 3, 2026 06:4329,206152,893,394141,851,0001,262,0002,113,536
5Aug 3, 2026 06:4329,214152,156,830142,115,0001,034,0002,113,536
6Aug 3, 2026 06:4329,220152,221,121141,903,0001,279,0002,113,536
7Aug 3, 2026 06:4329,239151,491,142142,265,0001,008,0002,113,536
8Aug 3, 2026 06:4329,251152,454,884142,308,0001,023,0002,113,536
9Aug 3, 2026 06:4329,571153,325,471143,623,0001,279,0002,113,536