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 15, 2026 22:35wnwnScore: 9,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:358,683100,080,84566,067,0006,006,0002,408,448
2Feb 15, 2026 22:358,787103,472,59063,944,0008,992,0002,457,600
3Feb 15, 2026 22:358,848100,153,95267,401,0006,035,0002,441,216
4Feb 15, 2026 22:359,799104,559,28173,301,0008,033,0002,453,504
5Feb 15, 2026 22:3510,014104,591,45775,106,0008,011,0002,293,760
6Feb 15, 2026 22:3510,224112,942,39676,872,0007,986,0002,457,600