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:39anboto1anboto1Score: 243,486Success
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:40242,5811,200,101,4901,186,540,0002,110,0002,113,536
2Jul 31, 2026 17:40242,7721,199,612,8601,188,519,0001,066,0002,113,536
3Jul 31, 2026 17:40243,0841,201,261,8351,188,926,0002,186,0002,113,536
4Jul 31, 2026 17:40243,4681,202,929,1741,191,917,0001,077,0002,113,536
5Jul 31, 2026 17:40243,4861,203,100,8481,192,003,0001,080,0002,113,536
6Jul 31, 2026 17:40243,7461,204,306,6471,193,288,0001,072,0002,113,536
7Jul 31, 2026 17:40244,2041,206,563,5321,195,524,0001,079,0002,113,536
8Jul 31, 2026 17:40244,3901,207,462,7481,196,447,0001,068,0002,113,536
9Jul 31, 2026 17:40244,7811,209,425,0681,198,213,0001,216,0002,113,536