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 02:53Josu San MartinJosu San MartinScore: 27,632Success
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 02:5427,586143,605,471133,988,0001,187,0002,113,536
2Aug 4, 2026 02:5427,595144,274,888133,957,0001,260,0002,113,536
3Aug 4, 2026 02:5427,596143,773,548133,966,0001,257,0002,113,536
4Aug 4, 2026 02:5427,630144,468,522134,125,0001,262,0002,113,536
5Aug 4, 2026 02:5427,632144,468,640134,394,0001,003,0002,113,536
6Aug 4, 2026 02:5427,635144,515,423134,368,0001,048,0002,113,536
7Aug 4, 2026 02:5427,682144,056,106134,373,0001,272,0002,113,536
8Aug 4, 2026 02:5427,905145,939,617135,726,0001,011,0002,113,536
9Aug 4, 2026 02:5428,226147,371,462137,300,0001,011,0002,113,536