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 listMar 31, 2025 14:43Dmitrii KravchenkoDmitrii KravchenkoScore: 70,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2025 14:4370,544610,820,692583,519,0001,998,0002,523,136
2Mar 31, 2025 14:4370,559608,344,703582,645,0002,998,0002,277,376
3Mar 31, 2025 14:4370,566606,638,938583,696,0001,998,0002,269,184