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 listDec 29, 2025 11:13Aman | अमनAman | अमनScore: 113,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 11:13113,296970,840,981939,355,000999,0002,519,040
2Dec 29, 2025 11:13113,374967,423,134940,002,0001,000,0002,260,992
3Dec 29, 2025 11:13113,486973,017,349940,938,000999,0002,519,040
4Dec 29, 2025 11:13113,545970,277,040941,424,000999,0002,519,040
5Dec 29, 2025 11:13113,615965,306,077942,002,0001,000,0002,519,040
6Dec 29, 2025 11:13113,627971,069,726942,102,0001,000,0002,519,040