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 listSep 25, 2026 17:07Andrew EpsteinAndrew EpsteinScore: 205,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 17:08205,4951,017,525,5721,005,818,0001,111,0002,117,632stderr
2Sep 25, 2026 17:08205,5111,017,448,6261,005,901,0001,104,0002,117,632stderr
3Sep 25, 2026 17:08205,5141,017,621,6071,005,911,0001,112,0002,117,632stderr
4Sep 25, 2026 17:08205,5821,018,051,9721,005,130,0002,222,0002,117,632stderr
5Sep 25, 2026 17:08205,5841,018,003,0311,005,206,0002,157,0002,117,632stderr
6Sep 25, 2026 17:08205,6421,018,238,1791,006,538,0001,109,0002,117,632stderr
7Sep 25, 2026 17:08205,6541,018,184,7421,006,592,0001,117,0002,117,632stderr
8Sep 25, 2026 17:08205,7931,018,837,8701,007,258,0001,130,0002,117,632stderr
9Sep 25, 2026 17:08206,1051,020,525,8331,008,802,0001,113,0002,117,632stderr