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 listSep 23, 2026 14:50Kevin HeaveyKevin HeaveyScore: 29,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 14:5129,775157,041,072144,785,0001,115,00020,480
2Sep 23, 2026 14:5129,775157,022,923144,765,0001,135,00020,480
3Sep 23, 2026 14:5129,781156,318,358144,811,0001,119,00020,480
4Sep 23, 2026 14:5129,781156,358,040144,820,0001,108,00020,480
5Sep 23, 2026 14:5129,783156,364,307144,822,0001,117,00020,480
6Sep 23, 2026 14:5129,790156,444,408144,870,0001,104,00020,480
7Sep 23, 2026 14:5129,799156,387,910144,886,0001,132,00020,480
8Sep 23, 2026 14:5129,917156,962,865145,485,0001,111,00020,480
9Sep 23, 2026 14:5130,014158,293,096145,949,0001,121,00020,480