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 21:46anboto1anboto1Score: 130,426Success
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 21:47129,733646,671,678633,190,0002,502,0002,113,536
2Jul 31, 2026 21:47130,144647,957,585636,355,0001,355,0002,113,536
3Jul 31, 2026 21:47130,159647,969,268636,408,0001,373,0002,113,536
4Jul 31, 2026 21:47130,212648,167,454636,682,0001,360,0002,113,536
5Jul 31, 2026 21:47130,426649,929,902637,709,0001,380,0002,113,536
6Jul 31, 2026 21:47131,652659,178,877643,711,0001,386,0002,117,632
7Jul 31, 2026 21:47131,733656,481,414644,115,0001,380,0002,113,536
8Jul 31, 2026 21:47132,087657,622,862645,851,0001,377,0002,113,536
9Jul 31, 2026 21:47133,978667,333,819655,142,0001,351,0002,113,536