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 listJun 28, 2026 09:17Shikhar SoniShikhar SoniScore: 125,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:18124,823620,923,419609,571,0002,063,0002,113,536
2Jun 28, 2026 09:18125,104622,746,439611,001,0002,010,0002,113,536
3Jun 28, 2026 09:18125,216623,005,413611,497,0002,063,0002,113,536
4Jun 28, 2026 09:18125,283623,251,490611,817,0002,073,0002,113,536
5Jun 28, 2026 09:18125,284623,318,776611,815,0002,078,0002,113,536
6Jun 28, 2026 09:18125,320623,435,185612,030,0002,042,0002,113,536
7Jun 28, 2026 09:18125,795625,786,283614,399,0002,001,0002,113,536
8Jun 28, 2026 09:18127,140632,305,428620,962,0002,024,0002,113,536
9Jun 28, 2026 09:18130,983651,338,730639,811,0002,007,0002,113,536