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 2, 2026 10:52Priyansh RathiPriyansh RathiScore: 78,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 10:5278,503686,959,014647,578,0003,997,0002,371,584
2Mar 2, 2026 10:5278,511681,748,897649,640,0001,998,0002,371,584
3Mar 2, 2026 10:5278,528683,687,571647,786,0003,998,0002,359,296