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 18:00anboto1anboto1Score: 184,484Success
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 18:00184,316913,205,837902,145,0001,004,0002,113,536
2Jul 31, 2026 18:00184,331913,249,766902,213,0001,013,0002,113,536
3Jul 31, 2026 18:00184,406913,586,622902,591,0001,002,0002,113,536
4Jul 31, 2026 18:00184,470913,873,018902,903,0001,001,0002,113,536
5Jul 31, 2026 18:00184,484913,987,114902,952,0001,021,0002,113,536
6Jul 31, 2026 18:00184,513914,136,390903,115,0001,002,0002,113,536
7Jul 31, 2026 18:00184,536914,271,919903,211,0001,019,0002,113,536
8Jul 31, 2026 18:00184,568914,738,049903,380,0001,004,0002,113,536
9Jul 31, 2026 18:00184,613914,638,956903,607,0001,001,0002,113,536