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 listAug 26, 2026 22:57Victor MerckléVictor MerckléScore: 14,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 22:5814,004124,430,393114,035,0002,203,0002,117,632stderr
2Aug 26, 2026 22:5814,017124,747,844114,209,0002,140,0002,117,632stderr
3Aug 26, 2026 22:5814,046125,085,406114,367,0002,218,0002,117,632stderr
4Aug 26, 2026 22:5814,061125,136,565114,488,0002,226,0002,117,632stderr
5Aug 26, 2026 22:5814,177125,938,787115,455,0002,218,0002,117,632stderr
6Aug 26, 2026 22:5814,222126,464,529115,844,0002,201,0002,117,632stderr
7Aug 26, 2026 22:5814,228127,120,553116,067,0002,033,0002,117,632stderr
8Aug 26, 2026 22:5814,249126,665,806116,101,0002,166,0002,117,632stderr
9Aug 26, 2026 22:5814,385127,735,766117,258,0002,143,0002,117,632stderr