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 02:12Karthik ReddyKarthik ReddyScore: 23,371Success
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 02:1323,338123,262,514113,288,0001,071,00020,480
2Oct 13, 2026 02:1323,343123,314,432113,324,0001,058,00020,480
3Oct 13, 2026 02:1323,360123,374,387113,358,0001,110,00020,480
4Oct 13, 2026 02:1323,365124,287,666113,422,0001,070,00020,480
5Oct 13, 2026 02:1323,371123,488,137113,454,0001,066,00020,480
6Oct 13, 2026 02:1323,376123,514,518113,482,0001,065,00020,480
7Oct 13, 2026 02:1323,387123,493,359113,533,0001,065,00020,480
8Oct 13, 2026 02:1323,404123,537,168113,611,0001,072,00020,480
9Oct 13, 2026 02:1323,503128,516,044114,073,0001,093,00020,480