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 4, 2026 05:15Josu San MartinJosu San MartinScore: 27,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 05:1627,193146,186,516132,211,0001,038,0002,113,536
2Aug 4, 2026 05:1627,196141,772,076132,009,0001,256,0002,113,536
3Aug 4, 2026 05:1627,205142,325,032132,056,0001,251,0002,113,536
4Aug 4, 2026 05:1627,217142,457,833132,099,0001,266,0002,113,536
5Aug 4, 2026 05:1627,250141,766,073132,476,0001,052,0002,113,536
6Aug 4, 2026 05:1627,317142,086,574132,835,0001,019,0002,113,536
7Aug 4, 2026 05:1627,497143,754,096133,476,0001,260,0002,113,536
8Aug 4, 2026 05:1627,497143,159,167133,473,0001,267,0002,113,536
9Aug 4, 2026 05:1628,165146,449,861136,755,0001,257,0002,113,536