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 22, 2026 14:01SneedSneedScore: 83,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 14:0183,022719,820,401562,620,000126,465,0002,846,720
2Feb 22, 2026 14:0183,673725,222,174576,915,000117,575,0002,904,064
3Feb 22, 2026 14:0183,795723,566,547558,796,000136,705,0002,969,600