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 3, 2026 03:49Josu San MartinJosu San MartinScore: 29,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 03:5029,358152,874,520142,850,0001,006,0002,113,536
2Aug 3, 2026 03:5029,371152,920,425142,889,0001,029,0002,113,536
3Aug 3, 2026 03:5029,383153,068,120142,704,0001,277,0002,113,536
4Aug 3, 2026 03:5029,413153,175,334142,858,0001,266,0002,113,536
5Aug 3, 2026 03:5029,414152,552,722142,868,0001,263,0002,113,536
6Aug 3, 2026 03:5029,416153,271,080142,870,0001,270,0002,113,536
7Aug 3, 2026 03:5029,441152,695,438143,001,0001,262,0002,113,536
8Aug 3, 2026 03:5029,658154,473,292144,057,0001,270,0002,113,536
9Aug 3, 2026 03:5030,164155,983,983146,796,0001,008,0002,113,536