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 2, 2026 11:39Josu San MartinJosu San MartinScore: 31,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:3931,236163,088,210151,957,0001,103,0002,113,536
2Aug 2, 2026 11:3931,258163,272,300152,056,0001,113,0002,113,536
3Aug 2, 2026 11:3931,473164,242,752153,103,0001,118,0002,113,536
4Aug 2, 2026 11:3931,474164,224,495153,131,0001,095,0002,113,536
5Aug 2, 2026 11:3931,488165,153,705153,174,0001,118,0002,113,536
6Aug 2, 2026 11:3931,501164,350,654153,240,0001,119,0002,113,536
7Aug 2, 2026 11:3931,505165,033,947153,257,0001,122,0002,113,536
8Aug 2, 2026 11:3931,510165,197,563153,268,0001,131,0002,113,536
9Aug 2, 2026 11:3931,526165,303,128153,348,0001,133,0002,113,536