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 23, 2026 15:07Andrew EpsteinAndrew EpsteinScore: 244,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:08242,9261,200,234,2041,189,084,0001,254,0002,113,536
2Aug 23, 2026 15:08243,1241,201,148,5281,190,308,0001,001,0002,113,536
3Aug 23, 2026 15:08243,5841,203,458,8851,192,304,0001,260,0002,113,536
4Aug 23, 2026 15:08244,4141,207,654,5731,196,633,0001,000,0002,113,536
5Aug 23, 2026 15:08244,4561,207,765,0901,196,834,0001,005,0002,113,536
6Aug 23, 2026 15:08244,7821,209,347,5161,198,371,0001,065,0002,113,536
7Aug 23, 2026 15:08244,7961,209,394,5171,198,251,0001,254,0002,113,536
8Aug 23, 2026 15:08245,0621,211,203,6311,199,796,0001,008,0002,113,536
9Aug 23, 2026 15:08245,0741,210,799,2771,199,860,0001,005,0002,113,536