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 listAug 1, 2026 01:03anboto1anboto1Score: 121,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 01:03120,170599,065,815587,605,0001,232,0002,113,536
2Aug 1, 2026 01:03120,231599,338,819587,890,0001,245,0002,113,536
3Aug 1, 2026 01:03120,558600,981,017589,539,0001,196,0002,113,536
4Aug 1, 2026 01:03121,082603,385,658592,148,0001,157,0002,113,536
5Aug 1, 2026 01:03121,085603,522,474592,105,0001,214,0002,113,536
6Aug 1, 2026 01:03121,452605,394,691593,891,0001,227,0002,113,536
7Aug 1, 2026 01:03122,097608,402,918597,045,0001,235,0002,113,536
8Aug 1, 2026 01:03122,101609,157,999597,054,0001,242,0002,113,536
9Aug 1, 2026 01:03122,768611,832,545600,350,0001,216,0002,113,536