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 listJul 27, 2026 13:45Kevin HeaveyKevin HeaveyScore: 52,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 14:0552,581267,728,124247,322,00010,328,00020,480
2Jul 27, 2026 14:0552,626267,971,416246,325,00011,544,00020,480
3Jul 27, 2026 14:0552,648268,072,000246,763,00011,214,00020,480
4Jul 27, 2026 14:0552,899269,398,642246,444,00012,765,00020,480
5Jul 27, 2026 14:0552,983270,904,652246,670,00012,948,0002,113,536
6Jul 27, 2026 14:0553,024269,929,950246,371,00013,448,00020,480
7Jul 27, 2026 14:0553,044270,000,233246,475,00013,443,00020,480
8Jul 27, 2026 14:0553,068270,108,376246,493,00013,543,00020,480
9Jul 27, 2026 14:0553,110271,073,403246,759,00013,484,00020,480