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 listMay 11, 2026 07:05wnwnScore: 3,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:083,28334,469,20526,246,0001,008,0002,113,536
2May 11, 2026 07:083,29035,342,96426,282,0001,033,0002,113,536
3May 11, 2026 07:083,30638,512,48126,411,0001,030,0002,113,536
4May 11, 2026 07:083,31036,054,96726,465,0001,013,0002,113,536
5May 11, 2026 07:083,33636,534,09626,685,0001,011,0002,113,536
6May 11, 2026 07:083,34637,015,27926,778,0001,002,0002,113,536
7May 11, 2026 07:083,45935,949,51527,679,0001,032,0002,113,536
8May 11, 2026 07:083,51036,682,43228,082,0001,051,0002,113,536
9May 11, 2026 07:083,53537,681,59428,318,0001,026,0002,113,536