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 3, 2026 11:59RuszrokRuszrokScore: 47,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 11:5947,020412,190,209390,262,00002,277,376
2Feb 3, 2026 11:5947,022414,907,721389,285,0001,000,0002,277,376
3Feb 3, 2026 11:5947,061416,596,304389,608,000998,0002,277,376
4Feb 3, 2026 11:5947,080414,818,757389,763,000999,0002,277,376
5Feb 3, 2026 11:5947,104416,658,040389,966,000999,0002,277,376
6Feb 3, 2026 11:5947,156421,884,086391,395,00002,277,376
7Feb 3, 2026 11:5947,592422,572,200393,015,0002,000,0002,277,376
8Feb 3, 2026 11:5947,970419,052,993397,148,0001,000,0002,277,376
9Feb 3, 2026 11:5948,004425,717,360398,432,00002,277,376