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 14:17Tomislav TunkovicTomislav TunkovicScore: 32,822Success
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 14:1832,245166,418,753156,865,0001,140,00020,480
2Aug 15, 2026 14:1832,249167,670,699156,898,0001,124,00020,480
3Aug 15, 2026 14:1832,402167,350,936157,632,0001,138,00020,480
4Aug 15, 2026 14:1832,724169,452,893159,203,0001,148,00020,480
5Aug 15, 2026 14:1832,822170,019,680159,688,0001,140,00020,480
6Aug 15, 2026 14:1833,175171,028,217161,386,0001,176,00020,480
7Aug 15, 2026 14:1833,445172,408,596162,827,0001,058,00020,480
8Aug 15, 2026 14:1833,599173,033,081163,435,0001,204,00020,480
9Aug 15, 2026 14:1834,495177,450,794167,889,0001,141,00020,480