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 listSep 11, 2026 07:57C#_userC#_userScore: 43,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 07:5743,743371,809,823362,071,0001,003,0002,117,632
2Sep 11, 2026 07:5743,747371,793,940362,098,0001,003,0002,117,632
3Sep 11, 2026 07:5743,747371,793,950362,103,0001,005,0002,117,632
4Sep 11, 2026 07:5743,748372,397,931362,106,0001,005,0002,117,632
5Sep 11, 2026 07:5743,749372,417,790362,120,0001,004,0002,117,632
6Sep 11, 2026 07:5743,752371,814,912362,138,0001,004,0002,117,632
7Sep 11, 2026 07:5743,759371,890,127362,199,0001,003,0002,117,632
8Sep 11, 2026 07:5743,763371,875,305362,230,0001,004,0002,117,632
9Sep 11, 2026 07:5743,769371,894,463362,283,0001,005,0002,117,632