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:37Tejas G.Tejas G.Score: 7,142Success
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:377,12182,421,97157,102,0002,003,0002,273,280
2Nov 5, 2025 01:377,12285,308,00257,111,0002,003,0002,265,088
3Nov 5, 2025 01:377,13280,728,84957,187,0002,006,0002,289,664
4Nov 5, 2025 01:377,13582,730,38257,211,0002,007,0002,289,664
5Nov 5, 2025 01:377,13685,658,36858,225,0001,003,0002,289,664
6Nov 5, 2025 01:377,13691,636,65157,222,0002,007,0002,289,664
7Nov 5, 2025 01:377,14284,388,46658,272,0001,004,0002,289,664
8Nov 5, 2025 01:377,19196,836,89959,684,00002,289,664
9Nov 5, 2025 01:377,19686,058,37757,733,0001,990,0002,519,040
10Nov 5, 2025 01:377,28383,527,80259,445,0001,007,0002,289,664
11Nov 5, 2025 01:377,28481,662,42759,453,0001,007,0002,265,088
12Nov 5, 2025 01:377,34384,679,84158,945,0001,998,0002,269,184