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:59wnwnScore: 4,685Success
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:594,68063,253,41336,854,0001,992,0002,494,464
2Feb 28, 2026 19:594,68560,109,64536,889,0001,994,0002,273,280
3Feb 28, 2026 19:594,69860,563,98636,997,0001,999,0002,498,560