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 15:55Josu San MartinJosu San MartinScore: 27,697Success
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 15:5627,667145,420,394134,299,0001,270,0002,113,536
2Aug 3, 2026 15:5627,683144,696,239134,391,0001,258,0002,113,536
3Aug 3, 2026 15:5627,694144,877,203134,440,0001,265,0002,113,536
4Aug 3, 2026 15:5627,696144,761,468134,460,0001,252,0002,113,536
5Aug 3, 2026 15:5627,697145,538,607134,448,0001,272,0002,113,536
6Aug 3, 2026 15:5627,704146,742,326134,732,0001,019,0002,113,536
7Aug 3, 2026 15:5627,710144,698,130134,713,0001,067,0002,117,632
8Aug 3, 2026 15:5627,892145,790,881135,633,0001,042,0002,113,536
9Aug 3, 2026 15:5627,985146,204,076135,850,0001,278,0002,113,536