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 listMay 31, 2026 20:28Jora BabayanJora BabayanScore: 62,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2026 20:2862,608528,589,291518,644,0001,004,0002,113,536
2May 31, 2026 20:2862,623528,917,665518,767,0001,005,0002,113,536
3May 31, 2026 20:2862,626528,839,572518,795,0001,004,0002,113,536
4May 31, 2026 20:2862,656528,957,755519,041,0001,004,0002,113,536
5May 31, 2026 20:2862,659529,077,146519,070,0001,003,0002,113,536
6May 31, 2026 20:2862,676529,251,566519,212,0001,003,0002,113,536
7May 31, 2026 20:2862,693529,366,241519,349,0001,004,0002,113,536
8May 31, 2026 20:2862,702529,537,559519,430,0001,004,0002,113,536
9May 31, 2026 20:2862,706529,463,139519,458,0001,005,0002,113,536