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 9, 2026 23:57Andrii StolitniiAndrii StolitniiScore: 86,099Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:5785,899729,440,288651,757,00061,206,0002,359,296
2May 9, 2026 23:5785,920729,111,486651,763,00061,373,0002,367,488
3May 9, 2026 23:5785,963730,528,111652,250,00061,245,0002,355,200
4May 9, 2026 23:5786,097733,353,686651,925,00062,683,0002,347,008
5May 9, 2026 23:5786,099734,176,707652,067,00062,559,0002,355,200
6May 9, 2026 23:5786,140729,591,601652,831,00062,133,0002,351,104
7May 9, 2026 23:5786,141729,728,449653,573,00061,400,0002,347,008
8May 9, 2026 23:5786,157731,863,213652,296,00062,810,0002,342,912
9May 9, 2026 23:5786,177731,860,141652,367,00062,907,0002,347,008