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:59anboto1anboto1Score: 57,750Success
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 21:0157,550290,482,848280,902,0001,095,0002,113,536
2Aug 3, 2026 21:0157,555290,489,054281,007,0001,014,0002,113,536
3Aug 3, 2026 21:0157,592290,693,077281,108,0001,093,0002,113,536
4Aug 3, 2026 21:0157,710291,865,715281,686,0001,097,0002,113,536
5Aug 3, 2026 21:0157,750292,079,916281,897,0001,081,0002,113,536
6Aug 3, 2026 21:0157,778291,524,489282,019,0001,094,0002,113,536
7Aug 3, 2026 21:0157,955292,446,532282,796,0001,188,0002,113,536
8Aug 3, 2026 21:0158,289294,109,726284,528,0001,092,0002,113,536
9Aug 3, 2026 21:0159,075298,609,712288,386,0001,082,0002,113,536