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 28, 2026 21:00Dominique GarmierDominique GarmierScore: 128,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 21:00128,240656,170,400627,379,000999,0002,281,472
2Mar 28, 2026 21:00128,248659,152,491627,414,000999,0002,281,472
3Mar 28, 2026 21:00128,278655,197,520626,562,0001,998,0002,281,472
4Mar 28, 2026 21:00128,306658,448,352627,698,000999,0002,277,376
5Mar 28, 2026 21:00128,535660,073,636628,823,000999,0002,281,472
6Mar 28, 2026 21:00128,546663,137,870628,876,000999,0002,371,584
7Mar 28, 2026 21:00128,553657,818,943627,909,0001,999,0002,281,472
8Mar 28, 2026 21:00128,581662,916,895629,047,0001,000,0002,281,472
9Mar 28, 2026 21:00128,659655,570,993628,431,0001,998,0002,273,280