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 listSep 23, 2026 19:30Kevin HeaveyKevin HeaveyScore: 25,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 19:3025,755136,603,327125,077,0001,127,00020,480
2Sep 23, 2026 19:3025,766136,701,008125,153,0001,101,00020,480
3Sep 23, 2026 19:3025,782137,509,953125,202,0001,131,00020,480
4Sep 23, 2026 19:3025,798136,771,174125,292,0001,122,00020,480
5Sep 23, 2026 19:3025,798136,856,365125,283,0001,128,00020,480
6Sep 23, 2026 19:3025,803136,906,212125,330,0001,106,00020,480
7Sep 23, 2026 19:3025,814136,936,931125,381,0001,109,00020,480
8Sep 23, 2026 19:3025,815136,857,373125,384,0001,110,00020,480
9Sep 23, 2026 19:3025,926137,562,501125,936,0001,105,00020,480