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:41Tomislav TunkovicTomislav TunkovicScore: 35,691Success
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:4135,475182,335,477172,673,0001,157,0002,117,632
2Aug 15, 2026 06:4135,545182,678,677173,002,0001,172,0002,117,632
3Aug 15, 2026 06:4135,548182,667,227172,954,0001,236,0002,117,632
4Aug 15, 2026 06:4135,556182,480,073173,017,0001,210,0002,117,632
5Aug 15, 2026 06:4135,691183,860,216173,767,0001,119,0002,117,632
6Aug 15, 2026 06:4135,888184,261,532174,693,0001,159,0002,117,632
7Aug 15, 2026 06:4135,972185,947,506175,141,0001,126,0002,117,632
8Aug 15, 2026 06:4136,150185,402,063176,027,0001,112,0002,117,632
9Aug 15, 2026 06:4136,160185,532,073176,008,0001,180,0002,117,632