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 15, 2026 14:52limanjun99limanjun99Score: 164,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 14:52162,705821,045,374795,257,0001,998,0002,289,664
2Mar 15, 2026 14:52163,365823,598,816798,491,0001,998,0002,289,664
3Mar 15, 2026 14:52163,581831,007,847800,546,000999,0002,289,664
4Mar 15, 2026 14:52163,763827,880,591799,442,0002,997,0002,265,088
5Mar 15, 2026 14:52164,320832,211,644802,171,0002,996,0002,289,664
6Mar 15, 2026 14:52164,335832,018,114803,244,0001,998,0002,273,280
7Mar 15, 2026 14:52164,336837,148,899803,248,0001,998,0002,289,664
8Mar 15, 2026 14:52164,365828,612,067803,389,0001,998,0002,269,184
9Mar 15, 2026 14:52165,819837,965,413809,516,0002,998,0002,285,568