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 3, 2026 01:57Josu San MartinJosu San MartinScore: 28,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 01:5828,864149,856,327140,166,0001,271,0002,113,536
2Aug 3, 2026 01:5828,866149,859,710140,198,0001,249,0002,113,536
3Aug 3, 2026 01:5828,869149,903,639140,186,0001,273,0002,113,536
4Aug 3, 2026 01:5828,888150,668,720140,287,0001,269,0002,113,536
5Aug 3, 2026 01:5828,896150,077,673140,310,0001,281,0002,113,536
6Aug 3, 2026 01:5829,011151,242,454140,894,0001,260,0002,113,536
7Aug 3, 2026 01:5829,036150,758,838141,010,0001,271,0002,113,536
8Aug 3, 2026 01:5829,129151,165,758141,468,0001,267,0002,113,536
9Aug 3, 2026 01:5829,326152,720,892142,435,0001,267,0002,113,536