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 21:09anboto1anboto1Score: 57,864Success
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:1157,597291,283,794281,066,0001,161,0002,113,536
2Aug 3, 2026 21:1157,777292,183,430281,973,0001,137,0002,113,536
3Aug 3, 2026 21:1157,781292,216,760282,029,0001,099,0002,113,536
4Aug 3, 2026 21:1157,825292,458,095282,263,0001,084,0002,113,536
5Aug 3, 2026 21:1157,864292,635,333282,401,0001,137,0002,113,536
6Aug 3, 2026 21:1157,969293,238,007282,953,0001,098,0002,113,536
7Aug 3, 2026 21:1157,977293,189,098282,968,0001,122,0002,113,536
8Aug 3, 2026 21:1157,983293,278,562282,949,0001,169,0002,113,536
9Aug 3, 2026 21:1158,265294,544,788284,402,0001,099,0002,113,536