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 4, 2026 15:30Victor MerckléVictor MerckléScore: 47,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:3047,399240,253,363230,218,0002,040,0002,117,632stderr
2Jul 4, 2026 15:3047,465240,283,653230,551,0002,028,0002,117,632stderr
3Jul 4, 2026 15:3047,551240,938,534230,967,0002,037,0002,117,632stderr
4Jul 4, 2026 15:3047,610246,159,686231,249,0002,043,0002,117,632stderr
5Jul 4, 2026 15:3047,620241,330,501231,321,0002,018,0002,117,632stderr
6Jul 4, 2026 15:3047,633241,401,894231,377,0002,027,0002,117,632stderr
7Jul 4, 2026 15:3047,670241,405,621231,531,0002,055,0002,117,632stderr
8Jul 4, 2026 15:3047,692241,639,952231,683,0002,009,0002,117,632stderr
9Jul 4, 2026 15:3047,838242,343,968232,328,0002,083,0002,117,632stderr