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:38anboto1anboto1Score: 57,632Success
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:4057,548290,437,869280,852,0001,138,0002,113,536
2Aug 3, 2026 20:4057,558290,527,032280,934,0001,103,0002,113,536
3Aug 3, 2026 20:4057,615290,755,870281,270,0001,044,0002,113,536
4Aug 3, 2026 20:4057,628290,882,918281,116,0001,264,0002,113,536
5Aug 3, 2026 20:4057,632290,845,702281,283,0001,117,0002,113,536
6Aug 3, 2026 20:4057,682291,011,821281,445,0001,201,0002,113,536
7Aug 3, 2026 20:4057,713291,243,384281,668,0001,128,0002,113,536
8Aug 3, 2026 20:4057,809291,652,783282,137,0001,129,0002,113,536
9Aug 3, 2026 20:4059,150298,383,033288,704,0001,133,0002,113,536