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 3, 2026 01:42Josu San MartinJosu San MartinScore: 29,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 01:4329,143151,204,451141,545,0001,260,0002,113,536
2Aug 3, 2026 01:4329,149151,238,795141,572,0001,262,0002,113,536
3Aug 3, 2026 01:4329,157151,323,189141,599,0001,271,0002,113,536
4Aug 3, 2026 01:4329,157151,084,212141,865,0001,005,0002,113,536
5Aug 3, 2026 01:4329,164151,961,794141,891,0001,014,0002,113,536
6Aug 3, 2026 01:4329,182151,419,357141,738,0001,255,0002,113,536
7Aug 3, 2026 01:4329,189151,499,611141,907,0001,120,0002,113,536
8Aug 3, 2026 01:4329,611153,571,466143,830,0001,268,0002,113,536
9Aug 3, 2026 01:4329,866154,832,311145,310,0001,036,0002,113,536