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 8, 2025 01:00Shikhar SoniShikhar SoniScore: 93,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 01:0093,044802,688,208771,270,000999,0002,392,064
2Dec 8, 2025 01:0093,065798,084,233771,438,000999,0002,269,184
3Dec 8, 2025 01:0093,130795,507,204770,978,0001,999,0002,269,184