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 listApr 22, 2026 10:32wnwnScore: 4,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 10:334,25948,384,52534,343,0001,010,0002,490,368
2Apr 22, 2026 10:334,26253,076,48934,372,0001,010,0002,486,272
3Apr 22, 2026 10:334,30052,161,55634,700,000991,0002,486,272
4Apr 22, 2026 10:334,31054,345,23733,794,0001,987,0002,482,176
5Apr 22, 2026 10:334,31149,980,89633,796,0001,988,0002,330,624
6Apr 22, 2026 10:334,34655,051,34134,069,0002,004,0002,486,272
7Apr 22, 2026 10:334,42053,896,30535,674,0001,019,0002,326,528
8Apr 22, 2026 10:334,43051,084,28434,782,0001,987,0002,478,080
9Apr 22, 2026 10:334,46051,877,19335,022,0002,001,0002,486,272