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 03:13Josu San MartinJosu San MartinScore: 28,970Success
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 03:1328,932150,190,376140,512,0001,257,0002,113,536
2Aug 3, 2026 03:1328,937150,283,588140,544,0001,249,0002,113,536
3Aug 3, 2026 03:1328,948150,293,994140,833,0001,017,0002,113,536
4Aug 3, 2026 03:1328,950150,073,625140,846,0001,013,0002,113,536
5Aug 3, 2026 03:1328,970151,036,904140,928,0001,029,0002,113,536
6Aug 3, 2026 03:1328,993150,544,272140,791,0001,278,0002,113,536
7Aug 3, 2026 03:1329,160154,991,109141,606,0001,278,0002,117,632
8Aug 3, 2026 03:1329,189151,390,377141,760,0001,268,0002,113,536
9Aug 3, 2026 03:1329,190151,492,431141,765,0001,269,0002,113,536