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:52A_ShamanA_ShamanScore: 167,405Success
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:53167,216828,551,979683,751,000135,611,0002,113,536
2Jun 20, 2026 16:53167,322829,011,763683,056,000136,822,0002,113,536
3Jun 20, 2026 16:53167,364829,313,015683,270,000136,818,0002,113,536
4Jun 20, 2026 16:53167,403829,394,170682,510,000137,765,0002,113,536
5Jun 20, 2026 16:53167,405829,494,757682,736,000137,550,0002,113,536
6Jun 20, 2026 16:53167,424829,501,616682,236,000138,145,0002,113,536
7Jun 20, 2026 16:53167,512830,107,220682,463,000138,349,0002,113,536
8Jun 20, 2026 16:53167,561830,195,557682,747,000138,302,0002,113,536
9Jun 20, 2026 16:53167,736831,103,139683,313,000138,595,0002,113,536