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 04:30Haha ExpertHaha ExpertScore: 301,803Success
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 04:31297,1121,466,238,1801,454,697,0001,152,0002,113,536
2Sep 12, 2026 04:31298,8191,474,739,9671,463,061,0001,153,0002,113,536
3Sep 12, 2026 04:31298,8241,474,749,7491,462,039,0002,202,0002,113,536
4Sep 12, 2026 04:31299,8331,479,618,9671,468,033,0001,149,0002,113,536
5Sep 12, 2026 04:31301,8031,489,535,3431,476,669,0002,166,0002,113,536
6Sep 12, 2026 04:31302,1071,491,567,2321,479,169,0001,156,0002,113,536
7Sep 12, 2026 04:31302,5281,492,802,0911,481,246,0001,143,0002,113,536
8Sep 12, 2026 04:31303,2051,496,857,9201,484,553,0001,154,0002,113,536
9Sep 12, 2026 04:31304,7571,503,731,3271,491,089,0002,221,0002,113,536