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 listJan 5, 2025 09:53scompa18scompa18Score: 90,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2025 09:5390,091776,121,485745,755,0001,999,0002,277,376
2Jan 5, 2025 09:5390,130769,455,768747,079,0001,000,0002,273,280
3Jan 5, 2025 09:5390,197777,407,761746,636,0001,999,0002,277,376