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 3, 2025 18:35Rajarshi BasuRajarshi BasuScore: 8,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 18:358,267101,031,00668,612,00002,289,664
2Dec 3, 2025 18:358,271100,387,07267,640,0001,009,0002,490,368
3Dec 3, 2025 18:358,27298,359,03867,648,0001,009,0002,289,664
4Dec 3, 2025 18:358,28697,660,78367,775,000996,0002,289,664
5Dec 3, 2025 18:358,28795,280,72066,790,0001,993,0002,289,664
6Dec 3, 2025 18:358,28993,911,16866,801,0001,994,0002,347,008
7Dec 3, 2025 18:358,29093,351,67666,813,0001,994,0002,289,664
8Dec 3, 2025 18:358,29096,597,98568,803,00002,289,664
9Dec 3, 2025 18:358,291100,578,96867,816,000997,0002,289,664
10Dec 3, 2025 18:358,46291,505,32469,229,0001,003,0002,490,368
11Dec 3, 2025 18:358,47997,100,21568,363,0002,010,0002,289,664
12Dec 3, 2025 18:358,48295,885,22868,391,0002,011,0002,494,464