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 27, 2026 06:08Victor MerckléVictor MerckléScore: 4,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 06:094,23644,110,64733,997,0001,164,0002,117,632stderr
2Aug 27, 2026 06:094,24743,648,80934,098,0001,154,0002,117,632stderr
3Aug 27, 2026 06:094,25143,588,24334,103,0001,184,0002,117,632stderr
4Aug 27, 2026 06:094,26143,741,32334,205,0001,168,0002,117,632stderr
5Aug 27, 2026 06:094,27944,354,57134,401,0001,118,0002,117,632stderr
6Aug 27, 2026 06:094,28243,853,57934,431,0001,117,0002,117,632stderr
7Aug 27, 2026 06:094,29843,964,77234,636,0001,043,0002,117,632stderr
8Aug 27, 2026 06:094,29844,049,65134,566,0001,111,0002,117,632stderr
9Aug 27, 2026 06:094,31544,212,95734,627,0001,190,0002,117,632stderr