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 listJan 23, 2026 02:54Josu San MartinJosu San MartinScore: 101,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 02:54101,896523,390,245494,286,0005,002,0002,281,472
2Jan 23, 2026 02:54101,905524,669,899493,332,0006,004,0002,281,472
3Jan 23, 2026 02:54101,961529,875,187494,614,0004,996,0002,457,600
4Jan 23, 2026 02:54101,970525,352,187494,657,0004,996,0002,281,472
5Jan 23, 2026 02:54101,970524,980,233494,658,0004,996,0002,306,048
6Jan 23, 2026 02:54101,987527,792,959494,741,0004,997,0002,281,472
7Jan 23, 2026 02:54101,993523,491,704496,766,0002,998,0002,461,696
8Jan 23, 2026 02:54102,434530,239,298497,927,0003,999,0002,453,504
9Jan 23, 2026 02:54103,178534,145,445500,578,0004,995,0002,281,472