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 03:35Josu San MartinJosu San MartinScore: 27,189Success
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 03:3627,177141,625,993131,904,0001,265,0002,113,536
2Aug 4, 2026 03:3627,181141,675,016131,922,0001,265,0002,113,536
3Aug 4, 2026 03:3627,182141,665,085131,944,0001,248,0002,113,536
4Aug 4, 2026 03:3627,185141,360,999132,191,0001,017,0002,113,536
5Aug 4, 2026 03:3627,189141,633,413131,969,0001,258,0002,113,536
6Aug 4, 2026 03:3627,203143,022,313132,095,0001,200,0002,113,536
7Aug 4, 2026 03:3627,207141,753,158132,051,0001,267,0002,113,536
8Aug 4, 2026 03:3627,208141,802,837132,192,0001,128,0002,113,536
9Aug 4, 2026 03:3627,210141,521,708132,059,0001,273,0002,113,536