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 11:50Josu San MartinJosu San MartinScore: 31,169Success
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 11:5131,143163,336,336151,471,0001,131,0002,113,536
2Aug 2, 2026 11:5131,152164,125,303151,526,0001,120,0002,113,536
3Aug 2, 2026 11:5131,155162,723,178151,535,0001,129,0002,113,536
4Aug 2, 2026 11:5131,156163,457,182151,548,0001,121,0002,113,536
5Aug 2, 2026 11:5131,169163,439,664151,589,0001,140,0002,113,536
6Aug 2, 2026 11:5131,176162,837,363151,635,0001,128,0002,113,536
7Aug 2, 2026 11:5131,404164,610,298152,743,0001,139,0002,113,536
8Aug 2, 2026 11:5133,092172,977,363161,033,0001,121,0002,113,536
9Aug 2, 2026 11:5139,398203,446,827191,930,0001,121,0002,113,536