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 03:30limanjun99limanjun99Score: 2,908,208Success
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 03:302,906,21914,271,546,02314,101,528,000138,946,0002,277,376
2Mar 15, 2026 03:302,906,49614,271,347,35414,116,894,000124,937,0002,277,376
3Mar 15, 2026 03:302,907,80714,277,469,22914,122,304,000125,949,0002,277,376
4Mar 15, 2026 03:302,907,81714,276,702,98614,124,361,000123,941,0002,277,376
5Mar 15, 2026 03:302,908,20814,282,010,02814,111,278,000138,943,0002,285,568
6Mar 15, 2026 03:302,908,85014,286,454,68914,123,434,000129,930,0002,277,376
7Mar 15, 2026 03:302,909,11614,290,496,13614,135,738,000118,930,0002,285,568
8Mar 15, 2026 03:302,909,33214,287,862,27014,132,791,000122,937,0002,273,280
9Mar 15, 2026 03:302,926,49014,377,623,06614,217,861,000121,938,0002,277,376