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 listJul 31, 2026 21:51anboto1anboto1Score: 129,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 21:51128,528640,113,878628,419,0001,370,0002,113,536
2Jul 31, 2026 21:51128,704640,869,515629,274,0001,376,0002,113,536
3Jul 31, 2026 21:51128,707640,957,061629,313,0001,353,0002,113,536
4Jul 31, 2026 21:51128,739641,017,422629,466,0001,359,0002,113,536
5Jul 31, 2026 21:51129,234643,432,065631,871,0001,380,0002,113,536
6Jul 31, 2026 21:51129,309643,781,256632,261,0001,354,0002,113,536
7Jul 31, 2026 21:51130,397649,183,756637,571,0001,379,0002,113,536
8Jul 31, 2026 21:51131,562654,851,951643,283,0001,373,0002,113,536
9Jul 31, 2026 21:51131,929656,653,743645,092,0001,362,0002,113,536