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 00:37Josu San MartinJosu San MartinScore: 27,345Success
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 00:3727,277141,854,668132,382,0001,278,0002,113,536
2Aug 4, 2026 00:3727,311142,179,826132,813,0001,011,0002,113,536
3Aug 4, 2026 00:3727,324142,377,292132,613,0001,278,0002,113,536
4Aug 4, 2026 00:3727,337142,075,088132,688,0001,268,0002,113,536
5Aug 4, 2026 00:3727,345144,394,731132,981,0001,012,0002,113,536
6Aug 4, 2026 00:3727,358142,616,180133,042,0001,013,0002,113,536
7Aug 4, 2026 00:3727,366142,628,056132,823,0001,274,0002,113,536
8Aug 4, 2026 00:3727,369142,470,422132,933,0001,177,0002,113,536
9Aug 4, 2026 00:3727,381142,634,023133,164,0001,006,0002,113,536