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 listJul 31, 2026 17:39George SeabridgeGeorge SeabridgeScore: 9,172Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:50Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:399,10685,590,59374,558,0001,022,0002,117,632
2Jul 31, 2026 17:399,12985,846,03074,756,0001,022,0002,117,632
3Jul 31, 2026 17:399,14585,860,42174,882,0001,022,0002,117,632
4Jul 31, 2026 17:399,14885,952,61374,906,0001,023,0002,117,632
5Jul 31, 2026 17:399,17286,186,63975,107,0001,022,0002,117,632
6Jul 31, 2026 17:399,17686,132,33875,141,0001,022,0002,117,632
7Jul 31, 2026 17:399,17786,125,26175,150,0001,021,0002,117,632
8Jul 31, 2026 17:399,19396,210,73975,284,0001,023,0002,117,632
9Jul 31, 2026 17:399,20786,461,17475,401,0001,023,0002,117,632