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 4, 2026 11:34Josu San MartinJosu San MartinScore: 26,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 11:3526,373141,140,284127,956,0001,273,0002,113,536
2Aug 4, 2026 11:3526,375138,282,204128,189,0001,053,0002,113,536
3Aug 4, 2026 11:3526,390138,574,849128,043,0001,271,0002,113,536
4Aug 4, 2026 11:3526,390138,248,530128,054,0001,259,0002,113,536
5Aug 4, 2026 11:3526,420137,848,232128,210,0001,249,0002,113,536
6Aug 4, 2026 11:3526,446137,875,858128,321,0001,268,0002,113,536
7Aug 4, 2026 11:3526,446138,675,260128,314,0001,275,0002,113,536
8Aug 4, 2026 11:3526,451139,608,108128,598,0001,015,0002,113,536
9Aug 4, 2026 11:3526,644139,614,717129,303,0001,256,0002,113,536