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 18:52wnwnScore: 7,771Success
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 18:526,74079,872,59753,944,0001,997,0002,482,176
2Feb 17, 2026 18:526,76083,487,19953,099,0003,005,0002,473,984
3Feb 17, 2026 18:526,79384,000,17352,351,0004,027,0002,301,952
4Feb 17, 2026 18:527,77187,534,29861,477,0003,023,0002,371,584
5Feb 17, 2026 18:527,82888,797,20261,977,0002,998,0002,449,408
6Feb 17, 2026 18:528,141103,242,03865,557,0002,017,0002,469,888