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 listDec 27, 2025 16:18Josu San MartinJosu San MartinScore: 32,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 16:1832,579295,769,839270,403,00002,289,664
2Dec 27, 2025 16:1832,580291,275,456269,410,0001,001,0002,289,664
3Dec 27, 2025 16:1832,613299,153,173268,689,0001,997,0002,453,504
4Dec 27, 2025 16:1832,632301,809,422269,846,000999,0002,289,664
5Dec 27, 2025 16:1832,652300,103,724270,009,0001,000,0002,289,664
6Dec 27, 2025 16:1832,664293,895,878269,112,0002,000,0002,359,296
7Dec 27, 2025 16:1832,706299,648,270271,456,00002,473,984
8Dec 27, 2025 16:1832,733298,315,244270,685,000998,0002,289,664
9Dec 27, 2025 16:1832,741299,034,257270,750,000999,0002,289,664
10Dec 27, 2025 16:1832,754301,137,224269,859,0001,998,0002,289,664
11Dec 27, 2025 16:1832,766298,844,864269,960,0001,999,0002,289,664
12Dec 27, 2025 16:1832,855297,720,560268,701,0003,995,0002,289,664