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 19, 2026 03:37Victor MerckléVictor MerckléScore: 50,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 03:3850,042252,817,971243,199,0002,009,0002,113,536
2Jun 19, 2026 03:3850,064253,021,770243,246,0002,070,0002,113,536
3Jun 19, 2026 03:3850,132253,271,857243,636,0002,014,0002,113,536
4Jun 19, 2026 03:3850,163253,402,423243,786,0002,016,0002,113,536
5Jun 19, 2026 03:3850,163253,424,443243,767,0002,032,0002,113,536
6Jun 19, 2026 03:3850,200253,362,253243,904,0002,078,0002,113,536
7Jun 19, 2026 03:3850,283254,033,502244,378,0002,013,0002,113,536
8Jun 19, 2026 03:3850,297254,078,477244,380,0002,079,0002,113,536
9Jun 19, 2026 03:3850,301254,113,277244,429,0002,050,0002,113,536