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 1, 2026 12:08Josu San MartinJosu San MartinScore: 35,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 12:0935,098182,094,772170,868,0001,114,0002,113,536
2Aug 1, 2026 12:0935,104182,842,213170,900,0001,114,0002,113,536
3Aug 1, 2026 12:0935,108182,057,437170,920,0001,112,0002,113,536
4Aug 1, 2026 12:0935,116182,154,636170,959,0001,112,0002,113,536
5Aug 1, 2026 12:0935,116182,272,497170,952,0001,121,0002,113,536
6Aug 1, 2026 12:0935,125183,069,807171,001,0001,114,0002,113,536
7Aug 1, 2026 12:0935,210194,259,930171,361,0001,171,0002,113,536
8Aug 1, 2026 12:0936,846190,715,506179,433,0001,116,0002,113,536
9Aug 1, 2026 12:0936,863191,504,043179,497,0001,136,0002,113,536