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 listMar 23, 2026 09:08Dominique GarmierDominique GarmierScore: 297,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 09:08297,7061,490,183,9321,455,761,0002,997,0002,273,280
2Mar 23, 2026 08:07297,8711,487,341,8901,457,569,0001,998,0002,318,336
3Mar 23, 2026 08:07297,9111,487,033,7411,458,763,000999,0002,273,280
4Mar 23, 2026 09:08297,9251,484,691,5381,457,835,0001,998,0002,314,240
5Mar 23, 2026 08:07298,7271,490,185,1401,461,763,0001,998,0002,281,472
6Mar 23, 2026 09:08298,8511,490,341,6701,462,371,0001,999,0002,281,472