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 27, 2026 06:12Karthik ReddyKarthik ReddyScore: 4,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 06:124,68249,249,64537,711,0001,155,0002,113,536
2Sep 27, 2026 06:124,77749,983,43538,512,0001,144,0002,113,536
3Sep 27, 2026 06:124,79150,147,61338,629,0001,144,0002,113,536
4Sep 27, 2026 06:124,82050,289,53538,857,0001,154,0002,113,536
5Sep 27, 2026 06:124,83250,434,90738,960,0001,153,0002,113,536
6Sep 27, 2026 06:124,83551,093,16238,989,0001,147,0002,113,536
7Sep 27, 2026 06:124,84251,950,18039,044,0001,148,0002,113,536
8Sep 27, 2026 06:124,84450,508,33339,065,0001,142,0002,113,536
9Sep 27, 2026 06:124,85050,534,53439,099,0001,157,0002,113,536