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 13:32Kevin HeaveyKevin HeaveyScore: 53,533Success
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 13:4753,220270,813,002249,913,00010,869,0002,113,536
2Jul 27, 2026 13:4753,242270,925,109249,859,00011,031,0002,113,536
3Jul 27, 2026 13:4753,246271,488,586250,049,00010,857,00020,480
4Jul 27, 2026 13:4753,463282,373,939249,731,00012,239,0002,113,536
5Jul 27, 2026 13:4753,533272,412,508249,621,00012,691,0002,113,536
6Jul 27, 2026 13:4753,633273,355,792249,936,00012,870,0002,113,536
7Jul 27, 2026 13:4753,651273,041,889250,071,00012,821,0002,113,536
8Jul 27, 2026 13:4753,740273,401,158249,685,00013,643,0002,113,536
9Jul 27, 2026 13:4753,774273,617,940249,529,00013,967,0002,113,536