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 21, 2026 00:45Dominique GarmierDominique GarmierScore: 437,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 00:45436,7452,172,080,1962,140,052,00002,273,280
2Mar 21, 2026 00:43436,7512,167,822,8292,138,083,0001,998,0002,273,280
3Mar 21, 2026 00:43436,7802,170,777,9622,138,226,0001,998,0002,392,064
4Mar 21, 2026 00:45437,0302,183,900,2282,140,451,000998,0002,273,280
5Mar 21, 2026 00:43438,0112,190,101,9092,145,257,000998,0002,273,280
6Mar 21, 2026 00:45438,6872,259,587,0882,148,570,000998,0002,265,088