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 17:07Josu San MartinJosu San MartinScore: 28,015Success
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 17:0928,004146,317,693135,963,0001,261,0002,113,536
2Aug 3, 2026 17:0928,005146,297,610135,972,0001,256,0002,113,536
3Aug 3, 2026 17:0928,005146,214,333135,965,0001,264,0002,113,536
4Aug 3, 2026 17:0928,006146,363,572135,969,0001,265,0002,113,536
5Aug 3, 2026 17:0928,015145,770,970136,215,0001,063,0002,113,536
6Aug 3, 2026 17:0928,016146,366,955136,024,0001,257,0002,113,536
7Aug 3, 2026 17:0928,023146,319,370136,064,0001,251,0002,113,536
8Aug 3, 2026 17:0928,034145,809,547136,267,0001,104,0002,113,536
9Aug 3, 2026 17:0928,334147,890,732137,578,0001,261,0002,113,536