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 15:24Dominique GarmierDominique GarmierScore: 128,261Success
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 15:24128,207652,971,768627,218,000998,0002,281,472
2Mar 28, 2026 15:24128,237657,143,593626,363,0001,997,0002,379,776
3Mar 28, 2026 15:24128,240655,089,868626,378,0001,998,0002,379,776
4Mar 28, 2026 15:24128,241660,493,856626,383,0001,998,0002,281,472
5Mar 28, 2026 15:24128,261655,074,770626,483,0001,998,0002,473,984
6Mar 28, 2026 15:24128,347654,965,723627,899,000999,0002,273,280
7Mar 28, 2026 15:24128,524658,014,022628,767,000999,0002,281,472
8Mar 28, 2026 15:24128,535654,838,937628,821,000999,0002,379,776
9Mar 28, 2026 15:24128,585654,816,683629,067,0001,000,0002,281,472