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 listMay 11, 2026 15:12Victor MerckléVictor MerckléScore: 95,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:1394,366471,126,326460,263,0002,131,0002,113,536
2May 11, 2026 15:1394,881475,801,938462,870,0002,051,0002,113,536
3May 11, 2026 15:1395,131477,341,370464,075,0002,068,0002,113,536
4May 11, 2026 15:1395,173475,240,179464,192,0002,156,0002,113,536
5May 11, 2026 15:1395,191477,363,374464,285,0002,151,0002,117,632
6May 11, 2026 15:1395,241475,873,617464,670,0002,011,0002,113,536
7May 11, 2026 15:1395,244478,977,474464,674,0002,025,0002,113,536
8May 11, 2026 15:1395,254478,684,161464,702,0002,043,0002,113,536
9May 11, 2026 15:1395,307477,551,415464,976,0002,029,0002,113,536