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 23, 2026 12:31Dominique GarmierDominique GarmierScore: 133,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 12:31133,009677,790,211650,747,000999,0002,383,872
2Mar 23, 2026 12:31133,047679,196,433650,932,000999,0002,281,472
3Mar 23, 2026 12:31133,076685,418,243651,071,0001,000,0002,281,472
4Mar 23, 2026 12:31133,106685,365,932650,222,0001,997,0002,383,872
5Mar 23, 2026 12:31133,112678,441,218651,251,000998,0002,281,472
6Mar 23, 2026 12:31133,134679,854,406651,357,000999,0002,281,472
7Mar 23, 2026 12:31133,235679,513,603652,851,00002,383,872
8Mar 23, 2026 12:31133,258675,458,937652,962,00002,379,776
9Mar 23, 2026 12:31133,317685,446,411651,255,0001,997,0002,375,680