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 06:11Josu San MartinJosu San MartinScore: 27,120Success
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 06:1127,057141,056,931131,326,0001,256,0002,113,536
2Aug 4, 2026 06:1127,079141,104,420131,634,0001,057,0002,113,536
3Aug 4, 2026 06:1127,089140,873,169131,476,0001,262,0002,113,536
4Aug 4, 2026 06:1127,113145,875,334131,594,0001,261,0002,113,536
5Aug 4, 2026 06:1127,120141,311,150131,624,0001,265,0002,113,536
6Aug 4, 2026 06:1127,160142,228,657132,039,0001,046,0002,113,536
7Aug 4, 2026 06:1127,184141,369,560131,923,0001,279,0002,113,536
8Aug 4, 2026 06:1127,288142,297,429132,437,0001,275,0002,113,536
9Aug 4, 2026 06:1127,358142,465,054132,872,0001,183,0002,117,632