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 listJan 25, 2024 11:42AnSaAnSaScore: 46,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2024 11:4246,461449,159,063385,622,66102,260,992
2Jan 25, 2024 11:3846,463446,519,933385,640,50302,277,376
3Jan 25, 2024 11:4246,463426,138,489385,639,10202,281,472
4Jan 25, 2024 11:3846,466430,562,481385,670,68802,277,376
5Jan 25, 2024 11:4246,466450,095,260385,667,50902,273,280
6Jan 25, 2024 11:3846,478446,400,461385,768,40402,281,472
7Jan 25, 2024 11:4255,268518,950,687458,723,82702,281,472
8Jan 25, 2024 11:4255,312525,733,664459,086,08102,277,376
9Jan 25, 2024 11:4255,319537,821,997459,143,88702,281,472