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 1, 2025 19:12Rajarshi BasuRajarshi BasuScore: 12,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2025 19:1212,073123,403,72598,203,0002,004,0002,383,872
2Dec 1, 2025 19:1212,086123,053,943100,312,00002,289,664
3Dec 1, 2025 19:1212,092121,995,89699,363,0001,003,0002,367,488
4Dec 1, 2025 19:1212,093122,727,48999,372,0001,003,0002,486,272
5Dec 1, 2025 19:1212,093127,875,076100,375,00002,289,664
6Dec 1, 2025 19:1212,100125,064,57999,426,0001,004,0002,379,776
7Dec 1, 2025 19:1212,108127,928,63199,489,0001,004,0002,289,664
8Dec 1, 2025 19:1212,110124,201,64699,504,0001,005,0002,289,664
9Dec 1, 2025 19:1212,116127,051,47299,561,0001,005,0002,289,664