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 27, 2026 10:21wnwnScore: 3,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:213,41647,104,30227,348,0001,012,0002,498,560
2Apr 27, 2026 10:213,42048,088,91027,375,0001,013,0002,486,272
3Apr 27, 2026 10:213,44545,169,95627,573,0001,021,0002,494,464
4Apr 27, 2026 10:213,45945,317,92927,686,0001,025,0002,486,272
5Apr 27, 2026 10:213,51845,267,10628,195,0001,006,0002,314,240
6Apr 27, 2026 10:213,54245,688,69728,392,0001,014,0002,482,176
7Apr 27, 2026 10:213,59343,296,04327,837,0001,988,0002,490,368
8Apr 27, 2026 10:213,59950,586,74927,882,0001,991,0002,482,176
9Apr 27, 2026 10:213,64647,389,32729,257,0001,008,0002,478,080