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 18, 2026 01:28Josu San MartinJosu San MartinScore: 25,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 01:3925,342133,896,225122,802,0001,377,0002,174,976
2Aug 18, 2026 01:3925,370134,427,323122,974,0001,342,0002,134,016
3Aug 18, 2026 01:3925,392134,203,261123,056,0001,367,0002,129,920
4Aug 18, 2026 01:3925,433134,363,110123,250,0001,376,0002,129,920
5Aug 18, 2026 01:3925,434135,169,792123,263,0001,364,0002,129,920
6Aug 18, 2026 01:3925,578135,091,170122,940,0002,397,0002,129,920
7Aug 18, 2026 01:3925,795136,078,376125,016,0001,384,0002,129,920
8Aug 18, 2026 01:3925,841136,334,826125,263,0001,360,0002,129,920
9Aug 18, 2026 01:3927,789148,981,997134,820,0001,349,0002,129,920