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 10:38Josu San MartinJosu San MartinScore: 26,268Success
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 10:3926,205136,768,459127,158,0001,251,0002,113,536
2Aug 4, 2026 10:3926,231136,962,494127,267,0001,268,0002,113,536
3Aug 4, 2026 10:3926,235137,658,835127,298,0001,258,0002,113,536
4Aug 4, 2026 10:3926,238136,887,975127,310,0001,258,0002,113,536
5Aug 4, 2026 10:3926,268137,034,212127,440,0001,274,0002,113,536
6Aug 4, 2026 10:3926,269137,101,758127,461,0001,260,0002,113,536
7Aug 4, 2026 10:3926,283137,397,580127,536,0001,255,0002,113,536
8Aug 4, 2026 10:3926,348137,805,991127,837,0001,269,0002,113,536
9Aug 4, 2026 10:3928,071146,599,943136,286,0001,262,0002,113,536