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,279Success
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,20188,255,93457,773,0001,992,0002,265,088
2Nov 5, 2025 01:377,20588,912,52258,806,000996,0002,523,136
3Nov 5, 2025 01:377,20984,662,75557,840,0001,994,0002,289,664
4Nov 5, 2025 01:377,27981,462,11060,418,00002,289,664
5Nov 5, 2025 01:377,28486,780,59059,447,0001,007,0002,289,664
6Nov 5, 2025 01:377,32187,199,50057,779,0002,988,0002,289,664