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 17:36Tomislav TunkovicTomislav TunkovicScore: 33,149Success
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 17:3732,082165,654,379156,194,0001,012,00020,480
2Aug 15, 2026 17:3732,147166,033,385156,516,0001,009,00020,480
3Aug 15, 2026 17:3732,170166,039,641156,619,0001,015,00020,480
4Aug 15, 2026 17:3732,220166,356,008156,871,0001,011,00020,480
5Aug 15, 2026 17:3733,149170,883,288161,421,0001,011,00020,480
6Aug 15, 2026 17:3733,988174,939,856165,532,0001,011,00020,480
7Aug 15, 2026 17:3741,641212,529,296203,039,0001,006,00020,480
8Aug 15, 2026 17:3755,319279,483,468270,058,0001,006,00020,480
9Aug 15, 2026 17:3762,969316,985,266306,482,0002,068,00020,480