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 listAug 13, 2026 18:55Tomislav TunkovicTomislav TunkovicScore: 36,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 18:5936,384187,261,066177,126,0001,158,0002,117,632
2Aug 13, 2026 18:5936,434186,824,745177,355,0001,176,0002,117,632
3Aug 13, 2026 18:5936,561187,392,578178,061,0001,089,0002,117,632
4Aug 13, 2026 18:5936,580187,637,999178,148,0001,094,0002,117,632
5Aug 13, 2026 18:5936,665187,903,223178,491,0001,171,0002,117,632
6Aug 13, 2026 18:5936,666188,222,073178,492,0001,174,0002,117,632
7Aug 13, 2026 18:5936,742188,249,534178,856,0001,183,0002,117,632
8Aug 13, 2026 18:5937,244190,870,755181,327,0001,170,0002,117,632
9Aug 13, 2026 18:5937,255191,065,237181,400,0001,154,0002,117,632