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 listApr 10, 2026 10:58Danylo MocherniukDanylo MocherniukScore: 4,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 10:584,83364,574,78238,108,0002,005,0002,297,856
2Apr 10, 2026 10:584,84663,059,10838,208,0002,010,0002,297,856
3Apr 10, 2026 10:584,85266,781,86039,264,0001,006,0002,408,448
4Apr 10, 2026 10:584,86861,502,97037,375,0003,030,0002,400,256
5Apr 10, 2026 10:584,87861,853,41937,450,0003,036,0002,502,656
6Apr 10, 2026 10:584,92167,386,15038,853,0001,992,0002,297,856
7Apr 10, 2026 10:584,94668,913,58239,048,0002,002,0002,387,968
8Apr 10, 2026 10:585,04467,747,94639,869,0001,993,0002,383,872
9Apr 10, 2026 10:585,08566,672,21339,191,0003,014,0002,297,856