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 listDec 9, 2025 21:51pseppsepScore: 47,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 21:5147,108418,204,565387,996,0002,999,0002,273,280
2Dec 9, 2025 21:5147,115424,112,105389,053,0002,000,0002,273,280
3Dec 9, 2025 21:5147,227424,077,324389,985,0001,999,0002,273,280
4Dec 9, 2025 21:5147,269420,857,910390,330,0002,001,0002,527,232
5Dec 9, 2025 21:5147,284416,900,311391,455,0001,001,0002,273,280
6Dec 9, 2025 21:5147,306422,537,202390,640,0001,998,0002,265,088
7Dec 9, 2025 21:5147,420422,445,649391,590,0001,997,0002,523,136
8Dec 9, 2025 21:5147,436424,540,021392,718,000999,0002,265,088
9Dec 9, 2025 21:5147,464428,489,026391,952,0001,999,0002,273,280