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 20:18Josu San MartinJosu San MartinScore: 30,046Success
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 20:1930,015157,216,045145,960,0001,118,0002,113,536
2Aug 2, 2026 20:1930,038158,031,341146,043,0001,146,0002,113,536
3Aug 2, 2026 20:1930,043157,209,527146,090,0001,122,0002,113,536
4Aug 2, 2026 20:1930,046158,031,166146,106,0001,121,0002,113,536
5Aug 2, 2026 20:1930,046158,002,823146,091,0001,135,0002,113,536
6Aug 2, 2026 20:1930,129157,685,386146,496,0001,137,0002,113,536
7Aug 2, 2026 20:1930,135157,712,941146,535,0001,131,0002,113,536
8Aug 2, 2026 20:1930,143158,431,540146,581,0001,124,0002,113,536
9Aug 2, 2026 20:1930,181169,742,210146,639,0001,249,0002,113,536