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 20:07anboto1anboto1Score: 57,702Success
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 20:0857,602290,676,046281,131,0001,120,0002,113,536
2Aug 3, 2026 20:0857,646290,885,225281,295,0001,174,0002,113,536
3Aug 3, 2026 20:0857,647290,912,634281,374,0001,098,0002,113,536
4Aug 3, 2026 20:0857,678291,606,841281,516,0001,110,0002,113,536
5Aug 3, 2026 20:0857,702291,768,074281,588,0001,153,0002,113,536
6Aug 3, 2026 20:0857,710291,866,650281,673,0001,109,0002,113,536
7Aug 3, 2026 20:0857,744292,041,938281,841,0001,109,0002,113,536
8Aug 3, 2026 20:0857,771295,359,727281,909,0001,171,0002,113,536
9Aug 3, 2026 20:0857,838291,854,982282,316,0001,093,0002,113,536