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 2, 2026 13:21anboto1anboto1Score: 129,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:22129,516644,820,093633,390,0001,241,0002,113,536
2Aug 2, 2026 13:22129,518644,852,850633,401,0001,242,0002,113,536
3Aug 2, 2026 13:22129,546644,969,562633,384,0001,395,0002,113,536
4Aug 2, 2026 13:22129,830646,198,709634,949,0001,222,0002,113,536
5Aug 2, 2026 13:22129,837646,514,823634,980,0001,224,0002,113,536
6Aug 2, 2026 13:22131,295653,434,924642,114,0001,232,0002,113,536
7Aug 2, 2026 13:22131,425654,695,304642,732,0001,253,0002,113,536
8Aug 2, 2026 13:22131,444654,234,147642,840,0001,238,0002,113,536
9Aug 2, 2026 13:22132,276658,310,449646,983,0001,173,0002,113,536