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 15, 2026 06:08Tomislav TunkovicTomislav TunkovicScore: 35,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 06:0935,447182,115,744172,607,0001,085,0002,117,632
2Aug 15, 2026 06:0935,536182,306,465173,064,0001,065,0002,117,632
3Aug 15, 2026 06:0935,584182,899,600173,207,0001,157,0002,117,632
4Aug 15, 2026 06:0935,590182,855,610173,300,0001,095,0002,117,632
5Aug 15, 2026 06:0935,637183,323,390173,466,0001,156,0002,117,632
6Aug 15, 2026 06:0935,651183,076,750173,603,0001,091,0002,117,632
7Aug 15, 2026 06:0935,750183,632,755174,089,0001,088,0002,117,632
8Aug 15, 2026 06:0935,870183,977,977174,583,0001,183,0002,117,632
9Aug 15, 2026 06:0935,942184,401,620174,952,0001,167,0002,117,632