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 2, 2026 13:37Josu San MartinJosu San MartinScore: 32,115Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:3732,042167,193,550155,884,0001,122,0002,113,536
2Aug 2, 2026 13:3732,047167,067,531155,895,0001,138,0002,113,536
3Aug 2, 2026 13:3732,066167,166,850155,979,0001,145,0002,113,536
4Aug 2, 2026 13:3732,108167,353,612156,239,0001,094,0002,113,536
5Aug 2, 2026 13:3732,115168,145,245156,241,0001,125,0002,113,536
6Aug 2, 2026 13:3732,209168,583,579156,709,0001,118,0002,113,536
7Aug 2, 2026 13:3732,254168,047,642156,934,0001,111,0002,113,536
8Aug 2, 2026 13:3735,572185,099,596173,159,0001,144,0002,113,536
9Aug 2, 2026 13:3738,033197,073,992185,060,0001,306,0002,113,536