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 26, 2026 19:36A_ShamanA_ShamanScore: 206,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 19:36202,0641,000,673,068987,078,0003,038,0002,113,536
2Jun 26, 2026 19:36203,8871,009,891,170997,046,0002,004,0002,113,536
3Jun 26, 2026 19:36204,1721,010,428,393998,273,0002,171,0002,113,536
4Jun 26, 2026 19:36205,9381,018,896,9741,007,094,0002,003,0002,113,536
5Jun 26, 2026 19:36206,0371,018,929,0931,007,582,0002,004,0002,113,536
6Jun 26, 2026 19:36206,0921,019,268,0291,006,640,0003,214,0002,113,536
7Jun 26, 2026 19:36208,0471,038,122,6711,016,424,0003,009,0002,113,536
8Jun 26, 2026 19:36208,0581,029,348,0431,017,359,0002,130,0002,113,536
9Jun 26, 2026 19:36208,8241,032,615,5651,020,038,0003,201,0002,113,536