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 listNov 4, 2025 18:15caandocaandoScore: 6,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 18:155,84369,287,49848,495,00002,273,280
2Nov 4, 2025 18:155,86279,886,62647,644,0001,013,0002,285,568
3Nov 4, 2025 18:155,93174,767,12447,217,0002,009,0002,285,568
4Nov 4, 2025 18:156,02074,656,27147,972,0001,998,0002,260,992
5Nov 4, 2025 18:156,02171,594,99747,974,0001,998,0002,519,040
6Nov 4, 2025 18:156,02175,116,55547,974,0001,998,0002,285,568