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 27, 2026 14:23Kevin HeaveyKevin HeaveyScore: 65,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 14:5365,244329,858,976310,930,0008,767,00020,480
2Jul 27, 2026 14:5365,271330,053,632310,842,0008,986,0002,113,536
3Jul 27, 2026 14:5365,399330,735,265311,209,0009,249,0002,113,536
4Jul 27, 2026 14:5365,537331,213,469311,299,0009,835,00020,480
5Jul 27, 2026 14:5365,597331,541,475310,675,00010,754,0002,113,536
6Jul 27, 2026 14:5365,746332,228,191310,647,00011,509,0002,113,536
7Jul 27, 2026 14:5365,757332,278,744310,871,00011,341,00020,480
8Jul 27, 2026 14:5365,818332,563,616311,961,00010,548,0002,113,536
9Jul 27, 2026 14:5365,880334,217,365310,561,00012,251,00020,480