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 19:35Tomislav TunkovicTomislav TunkovicScore: 35,638Success
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 19:4435,432183,245,559172,528,0001,092,0002,117,632
2Aug 13, 2026 19:4435,495182,174,108172,805,0001,122,0002,117,632
3Aug 13, 2026 19:4435,512182,299,146172,969,0001,040,0002,117,632
4Aug 13, 2026 19:4435,598182,699,710173,348,0001,087,0002,117,632
5Aug 13, 2026 19:4435,638183,551,288173,496,0001,132,0002,117,632
6Aug 13, 2026 19:4435,821183,821,800174,424,0001,099,0002,117,632
7Aug 13, 2026 19:4435,850183,869,234174,571,0001,097,0002,117,632
8Aug 13, 2026 19:4435,977184,664,406175,196,0001,095,0002,117,632
9Aug 13, 2026 19:4436,224185,906,663176,408,0001,094,0002,117,632