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:23anboto1anboto1Score: 57,824Success
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:2457,547291,028,064280,883,0001,100,0002,113,536
2Aug 3, 2026 21:2457,554291,117,219280,849,0001,169,0002,113,536
3Aug 3, 2026 21:2457,557290,601,431280,922,0001,112,0002,113,536
4Aug 3, 2026 21:2457,643291,624,681281,256,0001,197,0002,113,536
5Aug 3, 2026 21:2457,824292,333,044282,246,0001,095,0002,113,536
6Aug 3, 2026 21:2457,850292,573,648282,380,0001,088,0002,113,536
7Aug 3, 2026 21:2458,234294,492,404284,251,0001,097,0002,113,536
8Aug 3, 2026 21:2458,264294,691,379284,378,0001,119,0002,113,536
9Aug 3, 2026 21:2458,730296,436,095286,686,0001,094,0002,113,536