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 17:48anboto1anboto1Score: 175,941Success
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 17:49174,762866,626,035855,165,0001,171,0002,113,536
2Jul 31, 2026 17:49175,413869,687,049858,347,0001,181,0002,113,536
3Jul 31, 2026 17:49175,417869,743,310858,363,0001,183,0002,113,536
4Jul 31, 2026 17:49175,844871,858,034860,460,0001,179,0002,113,536
5Jul 31, 2026 17:49175,941872,274,504860,933,0001,179,0002,113,536
6Jul 31, 2026 17:49176,210874,352,871862,247,0001,183,0002,113,536
7Jul 31, 2026 17:49176,240873,670,210862,419,0001,160,0002,113,536
8Jul 31, 2026 17:49176,521875,222,355863,771,0001,184,0002,113,536
9Jul 31, 2026 17:49177,249879,055,558867,323,0001,200,0002,113,536