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:07Kevin HeaveyKevin HeaveyScore: 52,554Success
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:3552,135265,631,677246,719,0008,743,0002,113,536
2Jul 27, 2026 14:3552,170266,408,873246,604,0009,029,00020,480
3Jul 27, 2026 14:3552,236266,049,562246,842,0009,116,00020,480
4Jul 27, 2026 14:3552,483270,106,272247,317,0009,854,0002,113,536
5Jul 27, 2026 14:3552,554267,613,059246,529,00010,990,0002,113,536
6Jul 27, 2026 14:3552,569267,760,021247,270,00010,321,00020,480
7Jul 27, 2026 14:3552,650268,055,128246,345,00011,640,0002,113,536
8Jul 27, 2026 14:3552,773268,729,031246,480,00012,109,0002,113,536
9Jul 27, 2026 14:3552,955270,313,904246,505,00012,977,00020,480