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 21:49Josu San MartinJosu San MartinScore: 37,706Success
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 21:5037,687194,833,582183,544,0001,124,0002,113,536
2Jul 31, 2026 21:5037,693194,799,859183,578,0001,121,0002,113,536
3Jul 31, 2026 21:5037,699194,932,568183,528,0001,201,0002,113,536
4Jul 31, 2026 21:5037,704194,862,410183,650,0001,102,0002,113,536
5Jul 31, 2026 21:5037,706195,247,527183,643,0001,120,0002,113,536
6Jul 31, 2026 21:5037,707194,906,448183,645,0001,121,0002,113,536
7Jul 31, 2026 21:5037,712194,992,816183,654,0001,139,0002,113,536
8Jul 31, 2026 21:5037,738194,984,208183,815,0001,104,0002,113,536
9Jul 31, 2026 21:5037,846206,103,436184,293,0001,155,0002,113,536