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 listMar 19, 2026 20:31olliecrowolliecrowScore: 93,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 20:3193,686484,504,884458,063,0001,000,0002,277,376
2Mar 19, 2026 20:3193,689483,596,271457,077,0002,000,0002,371,584
3Mar 19, 2026 20:3193,695485,423,480458,107,0001,000,0002,465,792
4Mar 19, 2026 20:3193,701483,204,019458,135,0001,000,0002,277,376
5Mar 19, 2026 20:3193,719480,718,274458,222,0001,000,0002,277,376
6Mar 19, 2026 20:3193,734481,086,053459,298,00002,363,392
7Mar 19, 2026 20:3193,746481,598,890458,356,0001,000,0002,277,376
8Mar 19, 2026 20:3193,750482,779,685458,374,0001,000,0002,383,872
9Mar 19, 2026 20:3193,846497,509,567458,845,000999,0002,273,280