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 15, 2026 14:20Tomislav TunkovicTomislav TunkovicScore: 34,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 14:2132,108165,815,156156,182,0001,148,00020,480
2Aug 15, 2026 14:2132,135165,864,975156,247,0001,216,00020,480
3Aug 15, 2026 14:2132,318167,602,278157,223,0001,137,00020,480
4Aug 15, 2026 14:2132,826169,307,360159,703,0001,146,00020,480
5Aug 15, 2026 14:2134,393177,049,807167,386,0001,142,00020,480
6Aug 15, 2026 14:2135,101180,967,434170,863,0001,132,00020,480
7Aug 15, 2026 14:2135,121181,150,971171,022,0001,074,00020,480
8Aug 15, 2026 14:2152,602266,211,717256,622,0001,132,00020,480
9Aug 15, 2026 14:2153,667271,548,773261,815,0001,154,00020,480