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 9, 2026 07:10Karthik ReddyKarthik ReddyScore: 26,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:1126,036136,577,409115,665,00011,916,00020,480
2Oct 9, 2026 07:1126,207137,505,372115,700,00012,715,00020,480
3Oct 9, 2026 07:1126,534138,973,815115,595,00014,426,00020,480
4Oct 9, 2026 07:1126,575139,188,948116,180,00014,042,00020,480
5Oct 9, 2026 07:1126,602139,333,619115,682,00014,672,00020,480
6Oct 9, 2026 07:1126,637139,624,918115,790,00014,733,00020,480
7Oct 9, 2026 07:1126,665139,744,889115,917,00014,745,00020,480
8Oct 9, 2026 07:1126,720140,032,404115,826,00015,103,00020,480
9Oct 9, 2026 07:1126,736140,035,481115,567,00015,441,00020,480