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 4, 2026 13:43Josu San MartinJosu San MartinScore: 25,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 13:4325,349140,633,498123,171,0001,043,0002,117,632
2Aug 4, 2026 13:4325,358133,060,889122,996,0001,262,0002,113,536
3Aug 4, 2026 13:4325,360132,639,250122,991,0001,276,0002,113,536
4Aug 4, 2026 13:4325,362132,703,651123,017,0001,258,0002,113,536
5Aug 4, 2026 13:4325,363134,505,015123,015,0001,264,0002,113,536
6Aug 4, 2026 13:4325,370133,404,217123,053,0001,263,0002,113,536
7Aug 4, 2026 13:4325,403133,557,408123,473,0001,005,0002,113,536
8Aug 4, 2026 13:4325,441132,967,080123,414,0001,249,0002,113,536
9Aug 4, 2026 13:4325,443133,676,560123,398,0001,273,0002,113,536