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 26, 2026 10:21Dominique GarmierDominique GarmierScore: 929,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 13:24927,1574,565,570,4084,540,073,0002,998,0002,277,376
2Mar 27, 2026 07:00927,6034,574,807,2874,544,255,000999,0002,277,376
3Mar 27, 2026 07:00929,1054,576,464,8464,550,618,0001,998,0002,273,280
4Mar 25, 2026 13:24929,2324,589,045,9834,550,238,0002,997,0002,277,376
5Mar 26, 2026 10:21929,3144,584,159,9684,551,640,0001,998,0002,277,376
6Mar 27, 2026 07:00929,9334,586,170,6584,554,674,0001,998,0002,473,984
7Mar 25, 2026 13:24930,3154,585,913,0374,557,546,000999,0002,473,984
8Mar 26, 2026 10:21931,3284,595,205,0204,556,516,0006,993,0002,277,376
9Mar 26, 2026 10:21931,6384,594,997,0164,564,027,000999,0002,277,376