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 8, 2025 11:35Jatin GargJatin GargScore: 521,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:35521,4124,354,798,8454,256,758,00070,962,0002,285,568
2Dec 8, 2025 11:35521,6394,358,059,7284,249,652,00079,955,0002,375,680
3Dec 8, 2025 11:35521,7154,363,627,0944,253,266,00076,968,0002,273,280
4Dec 8, 2025 11:35521,7234,357,745,2554,260,326,00069,972,0002,273,280
5Dec 8, 2025 11:35521,7734,357,399,5394,263,752,00066,964,0002,494,464
6Dec 8, 2025 11:35521,7794,355,928,4024,253,809,00076,960,0002,482,176
7Dec 8, 2025 11:35521,8074,361,529,9364,250,051,00080,943,0002,273,280
8Dec 8, 2025 11:35522,5944,364,738,7524,250,577,00086,950,0002,273,280
9Dec 8, 2025 11:35524,3554,376,107,5774,274,182,00077,966,0002,273,280