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 30, 2026 21:11Josu San MartinJosu San MartinScore: 4,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:114,28743,990,74034,554,0001,032,0002,113,536
2Aug 30, 2026 21:114,28844,028,41734,550,0001,047,0002,113,536
3Aug 30, 2026 21:114,29544,074,02634,621,0001,030,0002,113,536
4Aug 30, 2026 21:114,29644,211,34134,630,0001,033,0002,113,536
5Aug 30, 2026 21:114,29844,163,94934,639,0001,042,0002,113,536
6Aug 30, 2026 21:114,32444,323,16234,850,0001,045,0002,113,536
7Aug 30, 2026 21:114,32444,298,69834,857,0001,040,0002,113,536
8Aug 30, 2026 21:114,36544,770,84235,112,0001,123,0002,113,536
9Aug 30, 2026 21:114,39444,916,66935,438,0001,036,0002,113,536