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 listJan 11, 2025 09:46Advait IyerAdvait IyerScore: 753,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 09:46752,3113,721,483,8573,683,326,0002,998,0002,285,568
2Jan 11, 2025 09:46753,0483,718,451,5403,686,936,0002,998,0002,506,752
3Jan 11, 2025 09:46753,1553,720,959,3193,687,463,0002,997,0002,338,816
4Jan 11, 2025 09:46753,3323,719,114,1613,688,330,0002,998,0002,293,760
5Jan 11, 2025 09:46753,5423,725,422,4653,689,358,0002,998,0002,293,760
6Jan 11, 2025 09:46753,8733,721,908,7383,690,978,0002,998,0002,510,848