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 5, 2025 11:06E SequeiraE SequeiraScore: 75,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 20:5874,883650,655,808563,577,00057,956,0002,371,584
2Feb 1, 2025 20:5874,893647,880,739562,652,00058,963,0002,486,272
3Feb 1, 2025 21:0674,926645,625,787570,897,00050,990,0002,326,528
4Feb 1, 2025 21:0674,938650,619,886569,984,00051,998,0002,326,528
5Feb 5, 2025 11:0675,051648,835,239569,928,00052,993,0002,322,432
6Feb 1, 2025 20:5875,064650,322,976561,028,00062,003,0002,326,528
7Feb 1, 2025 21:0675,077650,769,006570,131,00053,012,0002,355,200
8Feb 5, 2025 11:0675,162644,268,783558,864,00064,984,0002,326,528
9Feb 5, 2025 11:0675,237649,175,723565,515,00058,949,0002,326,528