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 20, 2026 16:56A_ShamanA_ShamanScore: 163,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 16:56162,732806,599,834668,713,000128,674,0002,113,536
2Jun 20, 2026 16:56162,872808,640,401668,426,000129,647,0002,113,536
3Jun 20, 2026 16:56163,002807,870,908670,052,000128,661,0002,113,536
4Jun 20, 2026 16:56163,138808,676,758668,919,000130,460,0002,113,536
5Jun 20, 2026 16:56163,235809,092,244668,555,000131,297,0002,113,536
6Jun 20, 2026 16:56163,242809,058,211669,199,000130,689,0002,113,536
7Jun 20, 2026 16:56163,275809,285,959669,604,000130,446,0002,113,536
8Jun 20, 2026 16:56163,537810,528,179669,687,000131,649,0002,113,536
9Jun 20, 2026 16:56163,569810,856,968669,189,000132,300,0002,113,536