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 20:26anboto1anboto1Score: 57,796Success
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 20:2857,540290,438,179280,844,0001,106,0002,113,536
2Aug 3, 2026 20:2857,628290,910,026281,261,0001,120,0002,113,536
3Aug 3, 2026 20:2857,744291,379,726281,860,0001,089,0002,113,536
4Aug 3, 2026 20:2857,747291,418,152281,768,0001,197,0002,113,536
5Aug 3, 2026 20:2857,796292,289,329282,011,0001,190,0002,113,536
6Aug 3, 2026 20:2858,341295,653,379284,788,0001,084,0002,113,536
7Aug 3, 2026 20:2858,711296,138,164286,588,0001,096,0002,113,536
8Aug 3, 2026 20:2858,734296,411,412286,769,0001,028,0002,113,536
9Aug 3, 2026 20:2858,776296,493,870286,887,0001,117,0002,113,536