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 listDec 5, 2025 00:15Dane UrbanDane UrbanScore: 395,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 00:15394,5343,301,782,6143,218,655,00055,976,0002,506,752
2Dec 5, 2025 00:15394,7583,301,704,1173,200,529,00075,965,0002,289,664
3Dec 5, 2025 00:15395,0723,311,840,7353,216,113,00062,982,0002,281,472
4Dec 5, 2025 00:15395,0753,308,053,3613,216,158,00062,963,0002,289,664
5Dec 5, 2025 00:15395,0963,302,337,3813,198,338,00080,957,0002,289,664
6Dec 5, 2025 00:15395,1993,308,430,5313,212,193,00067,961,0002,281,472
7Dec 5, 2025 00:15395,2663,310,121,6963,191,742,00088,964,0002,289,664
8Dec 5, 2025 00:15395,4823,305,340,6503,212,536,00069,968,0002,506,752
9Dec 5, 2025 00:15397,6803,333,008,7873,224,774,00075,971,0002,289,664