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:36anboto1anboto1Score: 57,716Success
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:3857,572291,162,853281,007,0001,097,0002,113,536
2Aug 3, 2026 21:3857,625290,783,115281,267,0001,100,0002,113,536
3Aug 3, 2026 21:3857,652290,907,389281,397,0001,101,0002,113,536
4Aug 3, 2026 21:3857,692291,152,315281,604,0001,088,0002,113,536
5Aug 3, 2026 21:3857,716291,355,700281,715,0001,096,0002,113,536
6Aug 3, 2026 21:3857,721291,310,255281,656,0001,179,0002,113,536
7Aug 3, 2026 21:3857,827292,419,940282,334,0001,021,0002,113,536
8Aug 3, 2026 21:3858,203293,745,984284,091,0001,104,0002,113,536
9Aug 3, 2026 21:3858,741296,316,937286,753,0001,082,0002,113,536