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:08anboto1anboto1Score: 57,754Success
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:0957,544290,403,683280,929,0001,041,0002,113,536
2Aug 3, 2026 20:0957,635290,845,437281,313,0001,101,0002,113,536
3Aug 3, 2026 20:0957,661290,956,087281,387,0001,154,0002,113,536
4Aug 3, 2026 20:0957,663291,122,460281,365,0001,185,0002,113,536
5Aug 3, 2026 20:0957,754291,425,381281,980,0001,018,0002,113,536
6Aug 3, 2026 20:0957,776292,198,318281,937,0001,166,0002,113,536
7Aug 3, 2026 20:0957,794292,236,835282,105,0001,086,0002,113,536
8Aug 3, 2026 20:0957,876293,394,461282,509,0001,086,0002,113,536
9Aug 3, 2026 20:0959,362299,278,485289,739,0001,139,0002,113,536