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 listApr 26, 2026 15:02wnwnScore: 3,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:053,42445,372,56227,409,0001,015,0002,490,368
2Apr 26, 2026 15:053,44950,177,04227,606,0001,022,0002,490,368
3Apr 26, 2026 15:053,45342,670,38827,637,0001,023,0002,482,176
4Apr 26, 2026 15:053,46344,907,07126,767,0001,982,0002,498,560
5Apr 26, 2026 15:053,47244,950,63226,835,0001,987,0002,330,624
6Apr 26, 2026 15:053,60245,482,97828,907,000996,0002,490,368
7Apr 26, 2026 15:053,62846,422,93328,110,0002,007,0002,482,176
8Apr 26, 2026 15:053,63345,433,42530,157,00002,560,000
9Apr 26, 2026 15:053,65249,757,50329,309,0001,010,0002,482,176