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:35Tejas G.Tejas G.Score: 7,481Success
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:357,27482,957,75659,365,0001,006,0002,289,664
2Nov 5, 2025 01:357,27785,430,11459,390,0001,006,0002,383,872
3Nov 5, 2025 01:357,28484,668,96759,454,0001,007,0002,289,664
4Nov 5, 2025 01:357,48183,867,83360,091,0002,003,0002,347,008
5Nov 5, 2025 01:357,48385,385,37660,102,0002,003,0002,289,664
6Nov 5, 2025 01:357,50084,708,95660,245,0002,008,0002,289,664