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 17:01Kevin HeaveyKevin HeaveyScore: 51,596Success
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 17:0251,403261,859,720250,081,0001,794,00020,480
2Jul 27, 2026 17:0251,411261,935,378250,076,0001,841,00020,480
3Jul 27, 2026 17:0251,430262,023,138250,176,0001,833,00020,480
4Jul 27, 2026 17:0251,580262,755,765250,965,0001,778,00020,480
5Jul 27, 2026 17:0251,596262,801,770250,840,0001,982,00020,480
6Jul 27, 2026 17:0251,612263,573,997249,826,0003,074,00020,480
7Jul 27, 2026 17:0251,650263,728,037251,230,0001,856,00020,480
8Jul 27, 2026 17:0251,662263,048,634251,229,0001,915,00020,480
9Jul 27, 2026 17:0251,699263,345,076250,421,0002,906,00020,480