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 16, 2026 23:14Tomislav TunkovicTomislav TunkovicScore: 888,844Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:39888,5164,363,144,2154,347,722,0006,007,00045,056
2Aug 17, 2026 05:39888,5424,363,250,2704,347,850,0006,009,00045,056
3Aug 17, 2026 05:39888,6114,363,528,0734,348,190,0006,007,00045,056
4Aug 17, 2026 05:39888,8364,365,125,1634,349,292,0006,008,00045,056
5Aug 17, 2026 05:39888,8444,364,706,3334,349,332,0006,008,00045,056
6Aug 17, 2026 05:39888,8484,364,542,4574,349,356,0006,004,00045,056
7Aug 17, 2026 05:39888,8534,364,936,6464,349,373,0006,008,00045,056
8Aug 17, 2026 05:39888,8944,364,946,0924,349,573,0006,009,00045,056
9Aug 17, 2026 05:39888,9344,364,965,2364,349,771,0006,010,00045,056