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 listMay 8, 2025 16:48Dmytro OvcharenkoDmytro OvcharenkoScore: 146,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2025 16:48146,4351,241,694,5421,213,408,0001,999,0002,260,992
2May 8, 2025 16:48146,4451,241,986,0841,213,493,0001,999,0002,383,872
3May 8, 2025 16:48146,4451,241,331,4211,213,493,0001,999,0002,519,040
4May 8, 2025 16:48146,5131,241,257,8391,215,058,0001,000,0002,506,752
5May 8, 2025 16:48146,8451,236,077,9131,217,811,000999,0002,256,896
6May 8, 2025 16:48146,8491,246,516,1471,217,845,000999,0002,260,992
7May 8, 2025 16:48146,8631,246,213,0871,217,963,000999,0002,256,896
8May 8, 2025 16:48146,8701,244,134,8031,218,024,0001,000,0002,506,752
9May 8, 2025 16:48154,3791,310,242,5701,279,348,0001,998,0002,260,992