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 29, 2026 13:00TudyMTudyMScore: 34,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:0034,554305,926,473284,808,0001,998,0002,387,968
2Apr 29, 2026 13:0034,613304,353,306285,289,0002,002,0002,314,240
3Apr 29, 2026 13:0034,614308,718,000286,300,0001,001,0002,379,776
4Apr 29, 2026 13:0034,626307,148,107285,398,0002,002,0002,396,160
5Apr 29, 2026 13:0034,629304,889,428287,425,00002,379,776
6Apr 29, 2026 13:0034,634306,501,199285,467,0002,003,0002,383,872
7Apr 29, 2026 13:0034,640308,807,623286,513,0001,001,0002,383,872
8Apr 29, 2026 13:0034,645306,449,773286,559,0001,001,0002,379,776
9Apr 29, 2026 13:0034,653305,258,226283,632,0003,994,0002,379,776