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 listMar 10, 2026 17:05caandocaandoScore: 5,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 17:055,05462,987,90640,950,000998,0002,285,568
2Mar 10, 2026 17:055,07967,241,45741,151,0001,003,0002,285,568
3Mar 10, 2026 17:055,08265,662,45340,169,0002,008,0002,285,568
4Mar 10, 2026 17:055,08467,181,30740,185,0002,009,0002,285,568
5Mar 10, 2026 17:055,10171,886,55039,314,0003,024,0002,285,568
6Mar 10, 2026 17:055,12570,968,94941,525,0001,012,0002,277,376