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 listJun 21, 2026 17:02A_ShamanA_ShamanScore: 136,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:02136,908679,997,927668,764,0002,086,0002,113,536
2Jun 21, 2026 17:02136,909679,963,363668,774,0002,082,0002,113,536
3Jun 21, 2026 17:02136,919680,145,793668,760,0002,144,0002,113,536
4Jun 21, 2026 17:02136,929680,070,312668,915,0002,038,0002,113,536
5Jun 21, 2026 17:02136,937680,088,238668,872,0002,123,0002,113,536
6Jun 21, 2026 17:02136,937680,093,115668,946,0002,047,0002,113,536
7Jun 21, 2026 17:02136,950680,189,716668,854,0002,204,0002,113,536
8Jun 21, 2026 17:02136,955680,198,854669,028,0002,056,0002,113,536
9Jun 21, 2026 17:02137,021680,523,444669,283,0002,123,0002,113,536