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 21:38Kevin HeaveyKevin HeaveyScore: 25,189Success
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 21:3925,166132,198,905122,243,0001,073,00020,480
2Sep 23, 2026 21:3925,180132,859,926122,330,0001,056,00020,480
3Sep 23, 2026 21:3925,183132,120,992122,348,0001,049,00020,480
4Sep 23, 2026 21:3925,188131,949,480122,356,0001,067,00020,480
5Sep 23, 2026 21:3925,189132,806,499122,380,0001,047,00020,480
6Sep 23, 2026 21:3925,195132,240,635122,402,0001,054,00020,480
7Sep 23, 2026 21:3925,197132,220,724122,408,0001,060,00020,480
8Sep 23, 2026 21:3925,272132,581,192122,784,0001,053,00020,480
9Sep 23, 2026 21:3925,412133,346,947123,464,0001,055,00020,480