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 26, 2026 19:30A_ShamanA_ShamanScore: 164,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 19:31163,282809,465,592668,239,000131,844,0002,113,536
2Jun 26, 2026 19:31163,351809,957,480667,853,000132,568,0002,113,536
3Jun 26, 2026 19:31163,734811,723,589668,311,000133,989,0002,113,536
4Jun 26, 2026 19:31164,063813,705,269668,033,000135,877,0002,113,536
5Jun 26, 2026 19:31164,195814,318,281668,628,000135,931,0002,113,536
6Jun 26, 2026 19:31164,225815,280,330668,353,000136,350,0002,113,536
7Jun 26, 2026 19:31164,308814,473,721668,422,000136,691,0002,113,536
8Jun 26, 2026 19:31164,480815,267,943668,757,000137,195,0002,113,536
9Jun 26, 2026 19:31164,834817,473,879669,341,000138,348,0002,113,536