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 listMar 6, 2025 09:49Paul KhadimPaul KhadimScore: 48,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2025 09:4948,035424,979,595396,692,0001,998,0002,277,376
2Mar 6, 2025 09:4948,041423,713,439396,743,0001,998,0002,277,376
3Mar 6, 2025 09:4948,045422,161,731395,779,0002,998,0002,277,376
4Mar 6, 2025 09:4948,046425,243,973396,783,0001,998,0002,277,376
5Mar 6, 2025 09:4948,051423,554,885396,821,0001,999,0002,281,472
6Mar 6, 2025 09:4948,064422,487,228396,936,0001,999,0002,277,376
7Mar 6, 2025 09:4948,067421,725,473395,956,0002,999,0002,277,376
8Mar 6, 2025 09:4948,070421,814,554394,978,0003,999,0002,527,232
9Mar 6, 2025 09:4948,070422,135,613396,978,0001,999,0002,273,280