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:20anboto1anboto1Score: 57,669Success
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:2157,571290,597,002281,002,0001,097,0002,113,536
2Aug 3, 2026 20:2157,632291,352,817281,300,0001,101,0002,113,536
3Aug 3, 2026 20:2157,641290,972,955281,350,0001,095,0002,113,536
4Aug 3, 2026 20:2157,653293,048,646281,390,0001,110,0002,113,536
5Aug 3, 2026 20:2157,669291,026,079281,480,0001,099,0002,113,536
6Aug 3, 2026 20:2157,679291,072,067281,536,0001,095,0002,113,536
7Aug 3, 2026 20:2157,719291,304,278281,697,0001,128,0002,113,536
8Aug 3, 2026 20:2158,259293,992,297284,345,0001,125,0002,113,536
9Aug 3, 2026 20:2159,210298,533,754289,034,0001,096,0002,113,536