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 listApr 23, 2026 21:01olliecrowolliecrowScore: 212,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 21:02212,7431,062,616,9561,039,444,0002,998,0002,420,736
2Apr 23, 2026 21:02212,7921,057,885,9291,039,684,0002,999,0002,490,368
3Apr 23, 2026 21:02212,8161,062,206,0081,040,800,0001,999,0002,416,640