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 17, 2026 19:50wnwnScore: 7,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:506,14977,328,94549,036,0002,001,0002,473,984
2Feb 17, 2026 19:506,24582,657,64350,839,000996,0002,502,656
3Feb 17, 2026 19:506,25175,742,71148,888,0002,993,0002,297,856
4Feb 17, 2026 19:507,20884,564,13656,836,0002,991,0002,514,944
5Feb 17, 2026 19:507,26686,343,67856,291,0004,020,0002,445,312
6Feb 17, 2026 19:507,40288,662,18758,418,0003,021,0002,387,968