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 listAug 21, 2025 09:41Asset MalikAsset MalikScore: 397,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 09:41391,7113,275,971,5853,174,246,00076,957,0002,281,472
2Aug 21, 2025 09:41394,1333,295,856,3023,213,336,00057,969,0002,367,488
3Aug 21, 2025 09:41395,1973,306,322,6203,201,180,00078,955,0002,285,568
4Aug 21, 2025 09:41397,3193,324,639,8413,225,796,00071,950,0002,351,104
5Aug 21, 2025 09:41397,5653,329,018,4753,237,812,00061,977,0002,281,472
6Aug 21, 2025 09:41402,0193,365,455,2573,254,865,00081,895,0002,281,472