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 23, 2025 20:44Dmitry YudakovDmitry YudakovScore: 116,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 20:44116,231989,398,428911,737,00052,984,0002,338,816
2Apr 23, 2025 20:44116,3331,002,540,401901,595,00063,971,0002,375,680
3Apr 23, 2025 20:44116,338992,834,696897,632,00067,972,0002,363,392
4Apr 23, 2025 20:44116,350994,283,431903,727,00061,981,0002,301,952
5Apr 23, 2025 20:44116,365993,158,027907,841,00057,989,0002,363,392
6Apr 23, 2025 20:44116,402998,747,969907,125,00059,008,0002,318,336
7Apr 23, 2025 20:44116,425990,678,427891,377,00074,947,0002,297,856
8Apr 23, 2025 20:44116,494988,721,240896,908,00069,992,0002,371,584
9Apr 23, 2025 20:44116,531993,454,934900,262,00066,945,0002,375,680