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 31, 2026 18:03anboto1anboto1Score: 162,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:04162,174804,738,540793,383,0001,271,0002,113,536
2Jul 31, 2026 18:04162,183804,933,814793,440,0001,259,0002,113,536
3Jul 31, 2026 18:04162,319805,625,128793,089,0002,275,0002,113,536
4Jul 31, 2026 18:04162,365805,807,329794,303,0001,289,0002,113,536
5Jul 31, 2026 18:04162,425806,037,328794,636,0001,251,0002,113,536
6Jul 31, 2026 18:04162,494806,512,731794,988,0001,237,0002,113,536
7Jul 31, 2026 18:04162,552807,395,044795,258,0001,251,0002,113,536
8Jul 31, 2026 18:04162,568807,541,003795,324,0001,263,0002,113,536
9Jul 31, 2026 18:04162,646807,164,402795,715,0001,254,0002,113,536