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:26anboto1anboto1Score: 57,419Success
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:2657,240289,004,243279,362,0001,118,0002,113,536
2Aug 3, 2026 22:2657,250289,637,994279,351,0001,174,0002,113,536
3Aug 3, 2026 22:2657,260289,085,150279,452,0001,123,0002,113,536
4Aug 3, 2026 22:2657,331289,395,462279,802,0001,121,0002,113,536
5Aug 3, 2026 22:2657,419291,135,562280,241,0001,115,0002,113,536
6Aug 3, 2026 22:2657,434289,806,075280,314,0001,116,0002,113,536
7Aug 3, 2026 22:2657,941293,071,280282,639,0001,272,0002,113,536
8Aug 3, 2026 22:2658,720296,161,264286,604,0001,125,0002,113,536
9Aug 3, 2026 22:2658,927297,220,528287,581,0001,163,0002,113,536