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 20:03anboto1anboto1Score: 61,405Success
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 20:0461,345309,682,513299,491,0001,104,0002,113,536
2Aug 3, 2026 20:0461,346309,026,877299,493,0001,105,0002,113,536
3Aug 3, 2026 20:0461,371309,869,203299,562,0001,157,0002,113,536
4Aug 3, 2026 20:0461,394308,986,232299,715,0001,116,0002,113,536
5Aug 3, 2026 20:0461,405309,387,528299,759,0001,126,0002,113,536
6Aug 3, 2026 20:0461,409309,277,839299,785,0001,121,0002,113,536
7Aug 3, 2026 20:0461,495310,526,810300,189,0001,139,0002,113,536
8Aug 3, 2026 20:0461,581314,925,609300,587,0001,164,0002,113,536
9Aug 3, 2026 20:0462,601316,479,902305,739,0001,009,0002,113,536