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 31, 2025 16:35AdityaAdityaScore: 65,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2025 16:3565,508570,316,423541,717,0001,998,0002,269,184
2Jan 31, 2025 16:3565,552569,659,532541,083,0003,000,0002,506,752
3Jan 31, 2025 16:3565,620572,058,696540,650,0003,997,0002,269,184