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 13, 2026 04:30Victor MerckléVictor MerckléScore: 51,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 04:3451,303260,499,159249,380,0002,009,0002,129,920
2Jun 13, 2026 04:3451,352260,620,497249,619,0002,009,0002,134,016
3Jun 13, 2026 04:3451,400260,906,276248,848,0003,015,0002,174,976
4Jun 13, 2026 04:3451,415260,886,829248,917,0003,020,0002,174,976
5Jun 13, 2026 04:3451,424261,154,301249,968,0002,014,0002,129,920
6Jun 13, 2026 04:3451,444261,183,482249,056,0003,021,0002,174,976
7Jun 13, 2026 04:3451,491261,390,955249,282,0003,025,0002,174,976
8Jun 13, 2026 04:3451,563261,737,901249,641,0003,022,0002,129,920
9Jun 13, 2026 04:3451,978263,777,747252,687,0002,009,0002,129,920