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 14:50Josu San MartinJosu San MartinScore: 75,078Success
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 14:5174,816376,800,711364,422,0002,181,0002,113,536
2Jul 31, 2026 14:5174,941378,662,187364,955,0002,259,0002,113,536
3Jul 31, 2026 14:5174,941377,259,145365,079,0002,134,0002,113,536
4Jul 31, 2026 14:5174,966377,606,952365,325,0002,012,0002,113,536
5Jul 31, 2026 14:5175,078377,952,673365,669,0002,217,0002,113,536
6Jul 31, 2026 14:5175,590380,481,277368,334,0002,059,0002,113,536
7Jul 31, 2026 14:5175,642380,727,326368,622,0002,026,0002,113,536
8Jul 31, 2026 14:5176,359384,299,089372,074,0002,088,0002,113,536
9Jul 31, 2026 14:5176,367384,391,217372,113,0002,089,0002,113,536