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 1, 2026 00:27Victor MerckléVictor MerckléScore: 53,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 00:2853,168268,282,714258,391,0002,137,0002,117,632stderr
2Jul 1, 2026 00:2853,176268,208,576258,401,0002,165,0002,117,632stderr
3Jul 1, 2026 00:2853,188268,361,885258,454,0002,168,0002,117,632stderr
4Jul 1, 2026 00:2853,211268,664,726258,718,0002,020,0002,117,632stderr
5Jul 1, 2026 00:2853,245268,592,649258,730,0002,173,0002,117,632stderr
6Jul 1, 2026 00:2853,252268,585,990258,923,0002,012,0002,117,632stderr
7Jul 1, 2026 00:2853,603270,379,750260,576,0002,082,0002,117,632stderr
8Jul 1, 2026 00:2853,632270,675,520260,770,0002,028,0002,117,632stderr
9Jul 1, 2026 00:2854,093272,756,618262,888,0002,172,0002,117,632stderr