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 28, 2026 12:19Charles CabergsCharles CabergsScore: 13,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 12:2013,487129,390,485109,951,0001,999,0002,367,488
2Apr 28, 2026 12:2013,506131,198,514111,104,0001,000,0002,359,296
3Apr 28, 2026 12:2013,691135,683,515111,650,0001,993,0002,363,392
4Apr 28, 2026 12:2013,695129,958,579111,682,0001,994,0002,371,584
5Apr 28, 2026 12:2013,699137,416,375111,710,0001,994,0002,367,488
6Apr 28, 2026 12:2013,699136,331,019111,711,0001,994,0002,367,488
7Apr 28, 2026 12:2013,699132,763,276112,701,0001,006,0002,306,048
8Apr 28, 2026 12:2013,701129,814,000111,731,0001,995,0002,371,584
9Apr 28, 2026 12:2013,716128,420,098111,847,0001,997,0002,428,928