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:00Kevin HeaveyKevin HeaveyScore: 58,157Success
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 13:1857,710292,628,633273,286,0009,494,00020,480
2Jul 27, 2026 13:1857,780293,021,294273,753,0009,373,00020,480
3Jul 27, 2026 13:1858,133294,704,851273,169,00011,686,00020,480
4Jul 27, 2026 13:1858,139294,811,659275,145,0009,738,00020,480
5Jul 27, 2026 13:1858,157294,869,898272,966,00012,005,00020,480
6Jul 27, 2026 13:1858,195295,157,321272,942,00012,217,00020,480
7Jul 27, 2026 13:1858,225295,177,400273,513,00011,792,00020,480
8Jul 27, 2026 13:1858,234295,251,447273,044,00012,305,00020,480
9Jul 27, 2026 13:1858,238295,208,672273,025,00012,342,00020,480