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 22, 2026 20:10Dominique GarmierDominique GarmierScore: 263,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 15:58262,4081,307,835,9401,282,798,0002,999,0002,473,984
2Mar 22, 2026 19:57262,4351,319,255,6121,283,932,0001,999,0002,387,968
3Mar 22, 2026 20:10262,4391,316,837,0401,282,954,0002,999,0002,535,424
4Mar 22, 2026 19:57263,1041,317,710,4401,288,210,000999,0002,514,944
5Mar 22, 2026 15:58263,1791,314,926,8341,287,579,0001,999,0002,457,600
6Mar 22, 2026 15:58263,1811,316,481,2741,288,588,000999,0002,465,792
7Mar 22, 2026 20:10263,7111,316,948,7381,288,189,0003,997,0002,465,792
8Mar 22, 2026 19:57264,4491,324,819,6231,292,803,0002,999,0002,437,120
9Mar 22, 2026 20:10266,4781,341,608,7051,302,744,0002,999,0002,342,912