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 3, 2026 22:00anboto1anboto1Score: 57,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 22:0057,587290,743,117281,088,0001,093,0002,113,536
2Aug 3, 2026 22:0057,610290,868,940281,013,0001,278,0002,113,536
3Aug 3, 2026 22:0057,666291,030,249281,523,0001,045,0002,113,536
4Aug 3, 2026 22:0057,679291,104,897281,543,0001,088,0002,113,536
5Aug 3, 2026 22:0057,703291,225,193281,574,0001,171,0002,113,536
6Aug 3, 2026 22:0057,754291,570,797281,813,0001,182,0002,113,536
7Aug 3, 2026 22:0057,798291,715,265282,126,0001,086,0002,113,536
8Aug 3, 2026 22:0059,028297,660,927288,152,0001,089,0002,113,536
9Aug 3, 2026 22:0059,922302,023,033292,531,0001,090,0002,113,536