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 11, 2024 02:37Joad NacerJoad NacerScore: 4,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 02:374,56563,492,58934,901,0002,991,0002,334,720
2Oct 11, 2024 02:374,57059,118,83835,935,0001,996,0002,334,720
3Oct 11, 2024 02:374,57660,384,66534,984,0002,998,0002,342,912
4Oct 11, 2024 02:374,64257,433,16038,530,00002,510,848
5Oct 11, 2024 02:374,65066,605,22037,580,0001,015,0002,330,624
6Oct 11, 2024 02:374,67763,158,31236,827,0001,990,0002,506,752