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 listAug 2, 2026 13:09Josu San MartinJosu San MartinScore: 32,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:1032,861171,059,600159,914,0001,109,0002,113,536
2Aug 2, 2026 13:1032,868171,123,921159,942,0001,113,0002,113,536
3Aug 2, 2026 13:1032,872172,362,138159,958,0001,116,0002,113,536
4Aug 2, 2026 13:1032,898172,103,572160,071,0001,133,0002,113,536
5Aug 2, 2026 13:1032,901172,058,970160,086,0001,129,0002,113,536
6Aug 2, 2026 13:1032,904171,565,802160,123,0001,111,0002,113,536
7Aug 2, 2026 13:1032,914171,230,190160,172,0001,110,0002,113,536
8Aug 2, 2026 13:1033,039171,935,430160,763,0001,129,0002,113,536
9Aug 2, 2026 13:1033,412174,490,310162,609,0001,112,0002,113,536