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 25, 2026 15:01Dominique GarmierDominique GarmierScore: 2,077,018Success
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 22:342,074,66710,191,716,24310,164,867,000999,0002,277,376
2Mar 25, 2026 14:382,075,84710,197,445,84010,167,654,0003,997,0002,277,376
3Mar 25, 2026 22:342,075,93310,207,407,70710,171,073,000999,0002,273,280
4Mar 25, 2026 15:012,076,44210,210,446,82010,172,567,0001,998,0002,273,280
5Mar 25, 2026 15:312,076,48010,205,057,67410,171,756,0002,998,0002,277,376
6Mar 25, 2026 14:382,076,56810,204,820,07410,173,185,0001,998,0002,277,376
7Mar 25, 2026 22:102,076,81310,208,132,37110,174,385,0001,998,0002,277,376
8Mar 25, 2026 15:312,077,01810,205,701,81410,176,391,000999,0002,273,280
9Mar 25, 2026 14:382,077,35410,214,844,12010,177,036,0001,998,0002,277,376
10Mar 25, 2026 15:312,077,43310,206,339,50910,177,426,0001,998,0002,277,376
11Mar 25, 2026 22:342,077,75610,209,254,98410,178,005,0002,998,0002,277,376
12Mar 25, 2026 22:102,077,76910,208,659,18410,178,068,0002,998,0002,465,792
13Mar 25, 2026 15:012,078,39310,213,800,56110,183,125,000999,0002,277,376
14Mar 25, 2026 22:102,079,67610,223,462,19610,188,413,0001,998,0002,273,280
15Mar 25, 2026 15:012,081,34110,226,674,81110,197,570,000999,0002,273,280