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 listMay 11, 2026 15:55wnwnScore: 101,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:57100,940504,484,240493,606,0001,004,0002,113,536
2May 11, 2026 15:57101,004502,279,663492,913,0002,011,0002,113,536
3May 11, 2026 15:57101,048502,886,734494,134,0001,005,0002,113,536
4May 11, 2026 15:57101,049516,194,056494,139,0001,005,0002,113,536
5May 11, 2026 15:57101,059502,557,007494,185,0001,005,0002,113,536
6May 11, 2026 15:57101,072504,154,573494,249,0001,004,0002,113,536
7May 11, 2026 15:57101,189504,625,532494,825,0001,004,0002,113,536
8May 11, 2026 15:57101,258505,528,427494,163,0002,005,0002,113,536
9May 11, 2026 15:57101,390507,302,607494,805,0002,006,0002,113,536