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 listOct 1, 2025 02:46Marpina BharaniMarpina BharaniScore: 2,069,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2025 02:462,066,83617,188,951,24317,086,775,00067,967,0002,277,376
2Oct 1, 2025 02:462,067,44917,193,119,50317,092,855,00066,968,0002,277,376
3Oct 1, 2025 02:462,067,64217,192,975,31017,097,459,00063,968,0002,289,664
4Oct 1, 2025 02:462,067,94217,201,840,76917,099,960,00063,962,0002,269,184
5Oct 1, 2025 02:462,069,61017,209,077,04117,129,787,00047,976,0002,285,568
6Oct 1, 2025 02:462,069,84917,214,780,92817,116,776,00062,969,0002,265,088
7Oct 1, 2025 02:462,071,89617,228,446,00817,135,769,00060,970,0002,277,376
8Oct 1, 2025 02:462,074,42417,252,203,95017,135,768,00081,955,0002,285,568
9Oct 1, 2025 02:462,075,59917,262,742,04517,152,506,00074,967,0002,285,568