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 06:45C#_userC#_userScore: 59,601Success
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 06:4559,453502,419,058492,464,0001,003,0002,117,632
2Sep 11, 2026 06:4559,454502,245,829492,469,0001,005,0002,117,632
3Sep 11, 2026 06:4559,471502,310,516492,614,0001,003,0002,117,632
4Sep 11, 2026 06:4559,586503,381,410493,566,0001,003,0002,117,632
5Sep 11, 2026 06:4559,601504,075,274493,686,0001,004,0002,117,632
6Sep 11, 2026 06:4559,720504,511,822494,676,0001,004,0002,117,632
7Sep 11, 2026 06:4559,736504,497,930494,811,0001,004,0002,117,632
8Sep 11, 2026 06:4559,795505,036,688495,296,0001,003,0002,117,632
9Sep 11, 2026 06:4559,874505,682,528495,954,0001,007,0002,117,632