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 listMar 4, 2026 17:03caandocaandoScore: 5,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 17:035,25868,354,14743,638,00002,519,040
2Mar 4, 2026 17:035,28375,291,79041,853,0001,993,0002,285,568
3Mar 4, 2026 17:035,29370,368,76641,937,0001,997,0002,269,184
4Mar 4, 2026 17:035,29975,366,31342,984,000999,0002,285,568
5Mar 4, 2026 17:035,34472,518,29342,337,0002,016,0002,519,040
6Mar 4, 2026 17:035,48967,273,27544,543,0001,012,0002,289,664