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 listSep 12, 2026 03:56Haha ExpertHaha ExpertScore: 151,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 03:57149,612744,330,358730,938,0002,163,0002,113,536
2Sep 12, 2026 03:57150,070745,768,518734,211,0001,134,0002,113,536
3Sep 12, 2026 03:57151,018751,252,130738,857,0001,136,0002,113,536
4Sep 12, 2026 03:57151,120750,885,337739,355,0001,136,0002,113,536
5Sep 12, 2026 03:57151,141751,219,067739,464,0001,130,0002,113,536
6Sep 12, 2026 03:57151,186751,169,458739,690,0001,125,0002,113,536
7Sep 12, 2026 03:57151,218751,409,171739,849,0001,124,0002,113,536
8Sep 12, 2026 03:57151,230752,378,898738,879,0002,151,0002,113,536
9Sep 12, 2026 03:57151,234752,296,638739,901,0001,146,0002,113,536