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 6, 2026 17:30Josu San MartinJosu San MartinScore: 5,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 17:305,19868,468,90240,136,0003,010,0002,506,752
2Mar 6, 2026 17:305,37474,041,24643,588,0001,013,0002,285,568
3Mar 6, 2026 17:305,39973,082,54242,824,0001,991,0002,506,752
4Mar 6, 2026 17:305,40175,435,42943,829,000996,0002,285,568
5Mar 6, 2026 17:305,48069,147,17144,473,0001,010,0002,510,848
6Mar 6, 2026 17:305,50170,105,33543,632,0002,029,0002,351,104