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 23, 2026 20:42wnwnScore: 4,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 20:424,37163,520,50635,274,0001,007,0002,273,280
2Feb 23, 2026 20:454,37657,739,83835,313,0001,008,0002,273,280
3Feb 23, 2026 20:454,39662,187,24335,473,0001,013,0002,490,368
4Feb 23, 2026 20:454,43859,601,50535,840,000995,0002,273,280
5Feb 23, 2026 20:424,50562,540,73336,380,0001,010,0002,535,424
6Feb 23, 2026 20:428,73799,709,28671,509,0001,007,0002,490,368