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 19:33Karthik ReddyKarthik ReddyScore: 23,735Success
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 19:3423,689125,011,380115,017,0001,061,00020,480
2Oct 12, 2026 19:3423,710125,074,294115,125,0001,058,00020,480
3Oct 12, 2026 19:3423,710125,056,500115,111,0001,068,00020,480
4Oct 12, 2026 19:3423,728125,292,340115,240,0001,032,00020,480
5Oct 12, 2026 19:3423,735125,181,520115,246,0001,060,00020,480
6Oct 12, 2026 19:3423,754125,343,756115,328,0001,069,00020,480
7Oct 12, 2026 19:3423,756126,675,996115,305,0001,104,00020,480
8Oct 12, 2026 19:3423,756125,329,125115,318,0001,087,00020,480
9Oct 12, 2026 19:3423,781125,433,713115,440,0001,087,00020,480