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 listFeb 18, 2026 18:31wnwnScore: 7,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:316,27377,930,07449,065,0003,004,0002,318,336
2Feb 18, 2026 18:316,45578,064,57751,552,0002,021,0002,473,984
3Feb 18, 2026 18:316,66679,605,88952,312,0003,018,0002,289,664
4Feb 18, 2026 18:317,50382,678,43560,265,0002,008,0002,457,600
5Feb 18, 2026 18:317,56893,495,33959,821,0002,991,0002,396,160
6Feb 18, 2026 18:318,05990,474,20262,897,0003,993,0002,445,312