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 07:01Josu San MartinJosu San MartinScore: 26,731Success
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 07:0126,705139,030,214129,601,0001,255,0002,113,536
2Aug 4, 2026 07:0126,706139,262,836129,856,0001,008,0002,113,536
3Aug 4, 2026 07:0126,724139,347,797129,687,0001,262,0002,113,536
4Aug 4, 2026 07:0126,727140,076,890129,700,0001,263,0002,113,536
5Aug 4, 2026 07:0126,731139,480,115129,729,0001,253,0002,113,536
6Aug 4, 2026 07:0126,732139,455,001129,964,0001,027,0002,113,536
7Aug 4, 2026 07:0126,742140,066,237129,780,0001,259,0002,113,536
8Aug 4, 2026 07:0126,744139,468,092129,775,0001,272,0002,113,536
9Aug 4, 2026 07:0126,750139,486,888130,074,0001,004,0002,113,536