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 20, 2026 01:56Victor MerckléVictor MerckléScore: 51,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 01:5750,972257,457,170247,609,0002,158,0002,113,536
2Jun 20, 2026 01:5750,972257,432,185247,733,0002,034,0002,113,536
3Jun 20, 2026 01:5750,990257,530,832247,671,0002,184,0002,113,536
4Jun 20, 2026 01:5751,035257,787,405248,039,0002,035,0002,113,536
5Jun 20, 2026 01:5751,084257,998,718248,300,0002,015,0002,113,536
6Jun 20, 2026 01:5751,093257,963,551248,331,0002,027,0002,113,536
7Jun 20, 2026 01:5751,150258,930,446248,573,0002,065,0002,113,536
8Jun 20, 2026 01:5751,159258,487,934248,572,0002,111,0002,113,536
9Jun 20, 2026 01:5751,867262,464,552252,030,0002,122,0002,113,536