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 listJan 13, 2025 08:07Ian MckibbenIan MckibbenScore: 1,279,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 08:071,264,7556,223,950,4166,194,304,0002,997,0002,519,040
2Jan 13, 2025 08:071,265,3556,233,790,0796,198,240,0001,998,0002,289,664
3Jan 13, 2025 08:071,269,7046,254,766,3246,218,552,0002,996,0002,289,664
4Jan 13, 2025 08:071,272,4206,261,097,8626,231,862,0002,997,0002,285,568
5Jan 13, 2025 08:071,279,2946,302,057,2556,266,543,0001,997,0002,289,664
6Jan 13, 2025 08:071,282,6006,320,805,7006,283,739,000999,0002,273,280
7Jan 13, 2025 08:071,285,9266,329,829,7646,298,040,0002,997,0002,281,472
8Jan 13, 2025 08:071,286,9386,337,825,2196,301,003,0004,994,0002,289,664
9Jan 13, 2025 08:071,302,5266,422,023,8976,380,382,0001,997,0002,523,136