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 listNov 5, 2025 01:59Tejas G.Tejas G.Score: 8,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 01:598,594100,792,85471,329,00002,527,232
2Nov 5, 2025 01:598,626101,905,29170,585,0001,008,0002,269,184
3Nov 5, 2025 01:598,62695,833,95270,587,0001,008,0002,289,664
4Nov 5, 2025 01:598,769104,013,93670,787,0001,994,0002,277,376
5Nov 5, 2025 01:598,770102,654,12570,796,0001,994,0002,289,664
6Nov 5, 2025 01:598,797100,175,09371,012,0002,000,0002,289,664