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 28, 2026 19:23wnwnScore: 5,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 19:235,64469,779,11445,828,0001,018,0002,277,376
2Feb 28, 2026 19:235,66571,645,05645,018,0002,000,0002,273,280
3Feb 28, 2026 19:235,66570,837,08845,018,0002,000,0002,277,376