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 listJul 31, 2026 17:19anboto1anboto1Score: 267,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:19246,9741,221,125,6461,090,369,000119,805,0002,113,536
2Jul 31, 2026 17:19248,7791,230,080,6961,098,787,000120,233,0002,113,536
3Jul 31, 2026 17:19249,1351,230,976,5551,100,724,000120,040,0002,113,536
4Jul 31, 2026 17:19266,6081,316,957,6361,183,465,000122,919,0002,113,536
5Jul 31, 2026 17:19267,6231,322,288,5821,187,636,000123,720,0002,113,536
6Jul 31, 2026 17:19267,7771,322,232,7331,187,708,000124,401,0002,113,536
7Jul 31, 2026 17:19268,0551,324,359,4341,189,602,000123,872,0002,113,536
8Jul 31, 2026 17:19268,3581,325,798,9201,190,593,000124,363,0002,113,536
9Jul 31, 2026 17:19268,4481,326,417,5971,191,241,000124,155,0002,113,536