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 03:41Karthik ReddyKarthik ReddyScore: 23,226Success
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 03:4223,188122,638,279112,536,0001,086,00020,480
2Oct 13, 2026 03:4223,206122,677,651112,637,0001,077,00020,480
3Oct 13, 2026 03:4223,222122,676,086112,715,0001,074,00020,480
4Oct 13, 2026 03:4223,223122,722,297112,658,0001,138,00020,480
5Oct 13, 2026 03:4223,226122,728,747112,742,0001,068,00020,480
6Oct 13, 2026 03:4223,234122,749,836112,776,0001,074,00020,480
7Oct 13, 2026 03:4223,249122,873,801112,868,0001,056,00020,480
8Oct 13, 2026 03:4223,282123,009,002113,012,0001,074,00020,480
9Oct 13, 2026 03:4223,332123,262,643113,268,0001,062,00020,480