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:59A_ShamanA_ShamanScore: 164,811Success
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:59164,269814,073,888675,448,000129,474,0002,113,536
2Jun 20, 2026 16:59164,386814,748,248676,256,000129,237,0002,113,536
3Jun 20, 2026 16:59164,417814,828,652676,345,000129,301,0002,113,536
4Jun 20, 2026 16:59164,750818,141,457676,495,000130,780,0002,113,536
5Jun 20, 2026 16:59164,811817,066,493676,945,000130,631,0002,113,536
6Jun 20, 2026 16:59164,890817,062,696677,677,000130,284,0002,113,536
7Jun 20, 2026 16:59165,052817,948,440676,207,000132,549,0002,113,536
8Jun 20, 2026 16:59165,161818,409,710676,279,000133,014,0002,113,536
9Jun 20, 2026 16:59165,321819,600,031676,413,000133,660,0002,113,536