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 listFeb 7, 2026 16:59Benn TanBenn TanScore: 394,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 16:59394,2983,300,066,5253,210,700,00061,974,0002,285,568
2Feb 7, 2026 16:59394,3253,300,782,2373,195,920,00076,974,0002,293,760
3Feb 7, 2026 16:59394,6103,301,030,0283,198,306,00076,959,0002,506,752
4Feb 7, 2026 16:59394,6703,300,007,0323,203,787,00071,972,0002,359,296
5Feb 7, 2026 16:59394,8703,306,082,8003,217,451,00059,971,0002,285,568
6Feb 7, 2026 16:59395,3903,311,028,9443,220,782,00060,958,0002,506,752
7Feb 7, 2026 16:59395,8223,308,853,8203,209,359,00075,961,0002,285,568
8Feb 7, 2026 16:59396,6093,314,377,0113,220,882,00070,975,0002,375,680
9Feb 7, 2026 16:59398,1643,332,316,4573,232,786,00071,972,0002,285,568