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:19anboto1anboto1Score: 59,634Success
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:2059,586300,975,304290,817,0001,155,0002,113,536
2Aug 3, 2026 20:2059,596300,455,485290,928,0001,095,0002,113,536
3Aug 3, 2026 20:2059,599300,186,505290,939,0001,099,0002,113,536
4Aug 3, 2026 20:2059,614301,251,715290,932,0001,180,0002,113,536
5Aug 3, 2026 20:2059,634300,631,126291,127,0001,082,0002,113,536
6Aug 3, 2026 20:2059,672300,855,532291,304,0001,090,0002,113,536
7Aug 3, 2026 20:2059,914302,115,734292,419,0001,164,0002,113,536
8Aug 3, 2026 20:2059,967302,346,023292,743,0001,096,0002,113,536
9Aug 3, 2026 20:2061,284308,895,326299,199,0001,094,0002,113,536