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 22, 2026 14:03SneedSneedScore: 71,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 14:0371,835636,591,735498,026,00098,202,0002,396,160
2Feb 22, 2026 14:0371,837623,590,953500,044,00096,201,0002,396,160
3Feb 22, 2026 14:0371,978623,902,126492,522,000104,898,0002,396,160