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 29, 2026 01:35Josu San MartinJosu San MartinScore: 24,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:3624,367127,789,951118,140,0001,263,0002,113,536
2Aug 29, 2026 01:3624,374127,986,471118,166,0001,267,0002,113,536
3Aug 29, 2026 01:3624,381127,953,777118,219,0001,252,0002,113,536
4Aug 29, 2026 01:3624,385128,433,806118,243,0001,248,0002,113,536
5Aug 29, 2026 01:3624,388128,149,872118,263,0001,241,0002,113,536
6Aug 29, 2026 01:3624,388127,870,645118,235,0001,267,0002,113,536
7Aug 29, 2026 01:3624,681129,364,565119,675,0001,262,0002,113,536
8Aug 29, 2026 01:3625,612133,888,676124,245,0001,258,0002,113,536
9Aug 29, 2026 01:3626,931140,339,574130,707,0001,255,0002,113,536