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 listFeb 22, 2026 13:46SneedSneedScore: 57,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 13:4657,553506,098,149419,728,00057,962,0002,289,664
2Feb 22, 2026 13:4657,557503,815,710423,755,00053,968,0002,277,376
3Feb 22, 2026 13:4657,563506,680,787416,799,00060,970,0002,289,664
4Feb 22, 2026 13:4657,608501,224,521425,130,00053,016,0002,318,336
5Feb 22, 2026 13:4657,664505,522,386418,661,00059,951,0002,314,240
6Feb 22, 2026 13:4657,682503,839,768418,788,00059,969,0002,281,472
7Feb 22, 2026 13:4657,798500,866,148422,758,00056,967,0002,289,664
8Feb 22, 2026 13:4657,874510,516,405425,314,00055,040,0002,281,472
9Feb 22, 2026 13:4658,473516,154,533422,285,00063,042,0002,289,664