Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 24, 2026 16:22spatialspatialScore: 72,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 16:2271,411620,995,912545,736,00046,977,0002,285,568
2Feb 24, 2026 16:2271,529622,262,088534,725,00058,969,0002,293,760
3Feb 24, 2026 16:2271,935616,689,931535,057,00062,006,0002,293,760
4Feb 24, 2026 16:2271,994624,239,303542,590,00054,958,0002,285,568
5Feb 24, 2026 16:2272,056623,068,943529,059,00069,007,0002,293,760
6Feb 24, 2026 16:2272,231627,699,301550,555,00048,960,0002,289,664
7Feb 24, 2026 16:2273,292635,432,517536,402,00071,919,0002,293,760
8Feb 24, 2026 16:2275,039650,442,277560,838,00061,982,0002,306,048
9Feb 24, 2026 16:2276,200663,749,787547,536,00084,928,0002,285,568