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 29, 2026 01:42Josu San MartinJosu San MartinScore: 24,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:4224,289128,063,212117,756,0001,264,0002,113,536
2Aug 29, 2026 01:4224,290127,395,169117,765,0001,259,0002,113,536
3Aug 29, 2026 01:4224,290127,416,996117,779,0001,246,0002,113,536
4Aug 29, 2026 01:4224,295128,042,011117,788,0001,261,0002,113,536
5Aug 29, 2026 01:4224,298127,486,368117,798,0001,263,0002,113,536
6Aug 29, 2026 01:4224,304127,620,999117,840,0001,253,0002,113,536
7Aug 29, 2026 01:4224,358127,809,465118,093,0001,262,0002,113,536
8Aug 29, 2026 01:4224,579128,755,439119,189,0001,252,0002,113,536
9Aug 29, 2026 01:4224,621129,092,308119,369,0001,278,0002,113,536