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:22Josu San MartinJosu San MartinScore: 27,395Success
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:2327,334142,474,469132,680,0001,261,0002,113,536
2Aug 4, 2026 07:2327,364142,546,628133,056,0001,032,0002,113,536
3Aug 4, 2026 07:2327,364142,536,999133,072,0001,012,0002,113,536
4Aug 4, 2026 07:2327,382142,644,779132,920,0001,256,0002,113,536
5Aug 4, 2026 07:2327,395142,677,775132,983,0001,257,0002,113,536
6Aug 4, 2026 07:2327,406142,423,839133,106,0001,187,0002,113,536
7Aug 4, 2026 07:2327,441142,839,800133,281,0001,182,0002,113,536
8Aug 4, 2026 07:2327,457142,704,733133,531,0001,009,0002,113,536
9Aug 4, 2026 07:2327,480143,082,855133,403,0001,253,0002,113,536