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 listApr 28, 2026 09:04TudyMTudyMScore: 35,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:0535,523313,379,909292,847,0001,998,0002,318,336
2Apr 28, 2026 09:0535,528313,394,290291,890,0002,998,0002,392,064
3Apr 28, 2026 09:0535,528315,249,894291,891,0002,998,0002,383,872
4Apr 28, 2026 09:0535,539309,644,465292,975,0001,999,0002,383,872
5Apr 28, 2026 09:0535,539310,440,322292,976,0001,999,0002,383,872
6Apr 28, 2026 09:0535,556316,503,334294,117,0001,000,0002,383,872
7Apr 28, 2026 09:0535,558313,897,388293,138,0002,000,0002,387,968
8Apr 28, 2026 09:0535,560312,700,852294,156,0001,000,0002,318,336
9Apr 28, 2026 09:0535,579311,067,577293,308,0002,002,0002,469,888