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 listFeb 17, 2026 19:14wnwnScore: 7,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:147,20984,579,12555,849,0003,989,0002,383,872
2Feb 17, 2026 19:147,27780,728,14857,383,0003,020,0002,400,256
3Feb 17, 2026 19:147,33282,498,54357,865,0002,993,0002,396,160
4Feb 17, 2026 19:147,34284,050,71757,942,0002,997,0002,392,064
5Feb 17, 2026 19:147,36489,861,50856,114,0005,010,0002,400,256
6Feb 17, 2026 19:147,36588,647,64859,125,0002,004,0002,396,160
7Feb 17, 2026 19:147,39985,478,23158,393,0003,020,0002,408,448
8Feb 17, 2026 19:147,41084,000,18457,467,0004,032,0002,437,120
9Feb 17, 2026 19:147,48984,356,74559,152,0003,007,0002,408,448