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 13:50Tomislav TunkovicTomislav TunkovicScore: 33,839Success
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 13:5333,672173,412,944163,838,0001,155,0002,117,632
2Aug 15, 2026 13:5333,693173,602,756163,917,0001,179,0002,117,632
3Aug 15, 2026 13:5333,745173,704,719164,145,0001,208,0002,117,632
4Aug 15, 2026 13:5333,756174,265,444164,155,0001,250,0002,117,632
5Aug 15, 2026 13:5333,839174,001,596164,645,0001,170,0002,117,632
6Aug 15, 2026 13:5333,887174,441,310164,882,0001,169,0002,117,632
7Aug 15, 2026 13:5333,935175,914,584165,128,0001,158,0002,117,632
8Aug 15, 2026 13:5334,044175,258,898165,640,0001,177,0002,117,632
9Aug 15, 2026 13:5334,197175,920,695166,370,0001,196,0002,117,632