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 16, 2026 15:25Dominique GarmierDominique GarmierScore: 158,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 15:25156,501797,039,687764,854,0001,999,0002,273,280
2Mar 16, 2026 15:27156,713791,671,601766,896,000999,0002,465,792
3Mar 16, 2026 15:25156,832794,659,102767,476,000999,0002,469,888
4Mar 16, 2026 15:25157,595799,072,791771,214,0001,000,0002,273,280
5Mar 16, 2026 15:27157,794802,162,648772,190,0001,000,0002,273,280
6Mar 16, 2026 15:27158,141804,121,315773,892,000999,0002,273,280
7Mar 16, 2026 15:27158,404804,212,756774,185,0001,997,0002,461,696
8Mar 16, 2026 15:25158,854805,139,775776,389,0001,998,0002,326,528
9Mar 16, 2026 15:25159,431812,585,975779,215,0001,997,0002,265,088
10Mar 16, 2026 15:25159,494815,155,626780,523,000999,0002,273,280
11Mar 16, 2026 15:25159,519808,873,707778,651,0002,994,0002,273,280
12Mar 16, 2026 15:27159,942809,588,783781,715,0001,999,0002,273,280
13Mar 16, 2026 15:27160,132817,050,631782,647,0001,999,0002,326,528
14Mar 16, 2026 15:25160,303813,819,404783,485,0001,998,0002,273,280
15Mar 16, 2026 15:25161,151815,745,989788,642,000999,0002,269,184