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:26Josu San MartinJosu San MartinScore: 27,227Success
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:2727,181141,582,678131,932,0001,256,0002,113,536
2Aug 4, 2026 02:2727,192141,697,844131,995,0001,247,0002,113,536
3Aug 4, 2026 02:2727,223141,822,348132,126,0001,270,0002,113,536
4Aug 4, 2026 02:2727,226141,630,250132,138,0001,274,0002,113,536
5Aug 4, 2026 02:2727,227142,094,991132,151,0001,266,0002,113,536
6Aug 4, 2026 02:2727,228142,522,444132,349,0001,071,0002,113,536
7Aug 4, 2026 02:2727,233142,178,270132,178,0001,265,0002,113,536
8Aug 4, 2026 02:2727,431142,922,319133,158,0001,257,0002,113,536
9Aug 4, 2026 02:2727,442143,556,570133,220,0001,250,0002,113,536