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 01:29Dominique GarmierDominique GarmierScore: 214,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 12:03214,3001,075,698,9121,048,070,0001,998,0002,281,472
2Mar 22, 2026 12:03214,3241,073,748,6991,049,190,000999,0002,281,472
3Mar 22, 2026 12:03214,4931,083,694,7101,049,018,0001,998,0002,371,584
4Mar 21, 2026 01:29214,5021,082,353,2371,049,061,0001,998,0002,375,680
5Mar 21, 2026 01:29215,0021,081,725,8001,053,511,00002,273,280
6Mar 21, 2026 01:29215,5061,090,719,4731,053,991,0001,988,0002,273,280