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 12, 2026 20:24Karthik ReddyKarthik ReddyScore: 23,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:2523,822125,638,489115,661,0001,070,00020,480
2Oct 12, 2026 20:2523,832125,634,561115,715,0001,063,00020,480
3Oct 12, 2026 20:2523,852125,775,308115,822,0001,057,00020,480
4Oct 12, 2026 20:2523,852125,854,252115,809,0001,069,00020,480
5Oct 12, 2026 20:2523,864125,822,692115,864,0001,070,00020,480
6Oct 12, 2026 20:2523,871125,865,269115,903,0001,065,00020,480
7Oct 12, 2026 20:2523,891126,003,606115,985,0001,081,00020,480
8Oct 12, 2026 20:2523,903125,993,619116,060,0001,069,00020,480
9Oct 12, 2026 20:2523,915126,099,492116,084,0001,104,00020,480