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 listDec 31, 2025 14:55Aniruddha DebAniruddha DebScore: 158,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 14:55157,717796,359,799771,812,000999,0002,424,832
2Dec 31, 2025 14:55157,995802,049,034772,179,0001,997,0002,531,328
3Dec 31, 2025 14:55158,562804,359,219776,955,00002,531,328
4Dec 31, 2025 14:55158,606806,000,573777,170,00002,412,544
5Dec 31, 2025 14:55158,748804,758,057776,868,000999,0002,273,280
6Dec 31, 2025 14:55158,967803,594,756777,939,000999,0002,420,736
7Dec 31, 2025 14:55160,285814,008,856785,396,00002,433,024
8Dec 31, 2025 14:55161,284818,512,443789,290,0001,000,0002,531,328
9Dec 31, 2025 14:55162,744823,287,765796,446,000999,0002,420,736