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 listOct 13, 2026 04:35Karthik ReddyKarthik ReddyScore: 23,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 04:3723,164122,369,805112,372,0001,135,00020,480
2Oct 13, 2026 04:3723,175122,325,713112,554,0001,008,00020,480
3Oct 13, 2026 04:3723,216122,519,372112,710,0001,051,00020,480
4Oct 13, 2026 04:3723,223122,675,488112,712,0001,085,00020,480
5Oct 13, 2026 04:3723,227122,549,528112,753,0001,062,00020,480
6Oct 13, 2026 04:3723,231122,597,741112,776,0001,060,00020,480
7Oct 13, 2026 04:3723,237122,638,270112,784,0001,078,00020,480
8Oct 13, 2026 04:3723,288122,891,429113,061,0001,051,00020,480
9Oct 13, 2026 04:3723,294122,872,695113,106,0001,039,00020,480