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 listApr 17, 2026 21:50Charles CabergsCharles CabergsScore: 163,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 21:50163,327827,871,581797,300,0003,001,0002,457,600
2Apr 17, 2026 21:50163,361830,229,836798,471,0001,998,0002,277,376
3Apr 17, 2026 21:50163,445832,260,396797,881,0002,999,0002,465,792
4Apr 17, 2026 21:50163,538825,808,571797,337,0004,001,0002,277,376
5Apr 17, 2026 21:50163,688826,243,740800,069,0002,000,0002,277,376
6Apr 17, 2026 21:50164,331832,558,919801,223,0004,001,0002,347,008
7Apr 17, 2026 21:50165,078836,338,765806,883,0001,999,0002,277,376
8Apr 17, 2026 21:50165,346831,684,393809,197,0001,000,0002,277,376
9Apr 17, 2026 21:50165,741838,216,205810,132,0002,000,0002,277,376