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 listSep 3, 2025 22:16Adam FolwarcznyAdam FolwarcznyScore: 7,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2025 22:167,32787,380,72046,860,00013,958,0002,277,376
2Sep 3, 2025 22:167,37382,406,43844,140,00017,054,0002,273,280
3Sep 3, 2025 22:167,45087,259,03445,879,00015,958,0002,273,280
4Sep 3, 2025 22:167,47591,319,33448,033,00014,009,0002,375,680
5Sep 3, 2025 22:167,51685,277,08547,290,00015,092,0002,359,296
6Sep 3, 2025 22:167,52487,936,51148,350,00014,102,0002,387,968