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 10, 2026 18:46Genos0Genos0Score: 1,684,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 18:511,610,12828,686,187,6933,599,179,0004,290,453,0002,113,536
2Jul 10, 2026 18:511,619,30926,071,357,7673,601,301,0004,333,316,0002,113,536
3Jul 10, 2026 18:511,620,83023,724,735,2923,599,944,0004,342,125,0002,113,536
4Jul 10, 2026 18:511,683,50723,842,758,4433,707,560,0004,541,628,0002,113,536
5Jul 10, 2026 18:511,684,47327,499,939,6663,711,907,0004,542,012,0002,138,112
6Jul 10, 2026 18:511,684,96629,673,221,2413,692,373,0004,563,962,0002,162,688
7Jul 10, 2026 18:511,688,93023,666,170,9033,730,081,0004,545,677,0002,134,016
8Jul 10, 2026 18:511,692,49324,100,569,5353,814,842,0004,478,374,0002,166,784
9Jul 10, 2026 18:511,695,21623,529,055,5123,733,455,0004,573,104,0002,162,688