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 22:56Josu San MartinJosu San MartinScore: 79,961Success
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 22:5779,877401,533,616389,213,0002,186,0002,113,536
2Jul 31, 2026 22:5779,910402,426,180389,300,0002,259,0002,113,536
3Jul 31, 2026 22:5779,951402,028,720389,755,0002,008,0002,113,536
4Jul 31, 2026 22:5779,956401,858,827389,563,0002,222,0002,113,536
5Jul 31, 2026 22:5779,961402,791,811389,803,0002,008,0002,113,536
6Jul 31, 2026 22:5780,219403,295,958391,068,0002,009,0002,113,536
7Jul 31, 2026 22:5780,236403,574,334390,923,0002,235,0002,113,536
8Jul 31, 2026 22:5780,490405,246,359392,190,0002,214,0002,113,536
9Jul 31, 2026 22:5781,679410,466,869398,141,0002,087,0002,113,536