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 31, 2026 17:15anboto1anboto1Score: 197,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:15197,596978,489,307967,105,0001,120,0002,113,536
2Jul 31, 2026 17:15197,602978,404,351967,130,0001,121,0002,113,536
3Jul 31, 2026 17:15197,605978,501,081967,165,0001,104,0002,113,536
4Jul 31, 2026 17:15197,610978,455,736967,163,0001,128,0002,113,536
5Jul 31, 2026 17:15197,617979,761,530967,199,0001,128,0002,113,536
6Jul 31, 2026 17:15197,631978,541,910967,280,0001,114,0002,113,536
7Jul 31, 2026 17:15197,674978,769,062967,362,0001,242,0002,113,536
8Jul 31, 2026 17:15197,677978,718,477966,494,0002,126,0002,113,536
9Jul 31, 2026 17:15197,717979,487,241967,685,0001,131,0002,113,536