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 16:01Josu San MartinJosu San MartinScore: 29,115Success
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 16:0129,061150,814,903141,148,0001,251,0002,113,536
2Aug 3, 2026 16:0129,078151,587,272141,477,0001,006,0002,113,536
3Aug 3, 2026 16:0129,095157,920,290141,553,0001,015,0002,117,632
4Aug 3, 2026 16:0129,110151,161,923141,639,0001,004,0002,113,536
5Aug 3, 2026 16:0129,115151,896,352141,387,0001,279,0002,113,536
6Aug 3, 2026 16:0129,161151,971,364141,632,0001,261,0002,113,536
7Aug 3, 2026 16:0129,172152,006,436141,698,0001,249,0002,113,536
8Aug 3, 2026 16:0129,626153,607,838143,901,0001,271,0002,113,536
9Aug 3, 2026 16:0130,096156,634,603146,196,0001,275,0002,113,536