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 02:22Josu San MartinJosu San MartinScore: 27,215Success
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 02:2327,167142,213,366131,875,0001,246,0002,113,536
2Aug 4, 2026 02:2327,202141,701,815132,021,0001,269,0002,113,536
3Aug 4, 2026 02:2327,207142,472,784132,040,0001,275,0002,113,536
4Aug 4, 2026 02:2327,210142,474,919132,072,0001,260,0002,113,536
5Aug 4, 2026 02:2327,215141,850,564132,236,0001,122,0002,113,536
6Aug 4, 2026 02:2327,243142,543,144132,234,0001,257,0002,113,536
7Aug 4, 2026 02:2327,255142,606,266132,448,0001,103,0002,113,536
8Aug 4, 2026 02:2327,390143,375,044132,966,0001,245,0002,113,536
9Aug 4, 2026 02:2327,796144,641,444134,941,0001,261,0002,113,536