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 29, 2026 01:51Josu San MartinJosu San MartinScore: 24,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:5224,208127,006,895117,362,0001,261,0002,113,536
2Aug 29, 2026 01:5224,214127,698,027117,407,0001,246,0002,113,536
3Aug 29, 2026 01:5224,214126,991,648117,384,0001,268,0002,113,536
4Aug 29, 2026 01:5224,214127,181,651117,389,0001,260,0002,113,536
5Aug 29, 2026 01:5224,215127,069,952117,404,0001,254,0002,113,536
6Aug 29, 2026 01:5224,218127,600,597117,419,0001,252,0002,113,536
7Aug 29, 2026 01:5224,219127,055,812117,432,0001,243,0002,113,536
8Aug 29, 2026 01:5224,777129,814,653120,161,0001,247,0002,113,536
9Aug 29, 2026 01:5225,460133,777,452123,511,0001,246,0002,113,536