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 listMay 7, 2026 11:07wnwnScore: 3,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 11:083,38244,300,40027,013,0001,060,0002,490,368
2May 7, 2026 11:083,38543,203,93627,058,0001,041,0002,482,176
3May 7, 2026 11:083,39243,789,57627,066,0001,095,0002,478,080
4May 7, 2026 11:083,40644,683,47527,189,0001,084,0002,486,272
5May 7, 2026 11:083,40944,187,76027,214,0001,081,0002,473,984
6May 7, 2026 11:083,47255,767,34427,729,0001,091,0002,490,368
7May 7, 2026 11:083,48144,200,00227,801,0001,098,0002,482,176
8May 7, 2026 11:083,56946,607,99028,551,0001,075,0002,482,176
9May 7, 2026 11:083,57845,563,99428,627,0001,071,0002,486,272