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 listJan 7, 2026 09:39Petsku01Petsku01Score: 68,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 09:4268,537597,336,634567,860,000999,0002,277,376
2Jan 7, 2026 09:3968,644601,307,526567,748,0001,999,0002,273,280
3Jan 7, 2026 09:4268,662593,586,741568,899,000999,0002,273,280
4Jan 7, 2026 09:3968,671598,225,345567,971,0001,999,0002,277,376
5Jan 7, 2026 09:3968,674599,054,648567,999,0001,999,0002,277,376
6Jan 7, 2026 09:4268,680599,773,795570,044,00002,400,256