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 listJun 21, 2026 16:54A_ShamanA_ShamanScore: 138,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 16:55138,039686,824,026674,310,0002,083,0002,113,536
2Jun 21, 2026 16:55138,070685,654,274674,502,0002,044,0002,113,536
3Jun 21, 2026 16:55138,115686,103,881674,701,0002,065,0002,113,536
4Jun 21, 2026 16:55138,120686,351,300674,712,0002,078,0002,113,536
5Jun 21, 2026 16:55138,174686,187,334675,054,0002,001,0002,113,536
6Jun 21, 2026 16:55138,193686,063,412675,077,0002,072,0002,113,536
7Jun 21, 2026 16:55138,205686,403,401675,202,0002,003,0002,113,536
8Jun 21, 2026 16:55138,215686,338,313675,127,0002,129,0002,113,536
9Jun 21, 2026 16:55139,014690,154,365679,057,0002,114,0002,113,536