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 listApr 24, 2026 16:44Charles CabergsCharles CabergsScore: 20,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 16:4420,164190,508,663166,361,0001,002,0002,367,488
2Apr 24, 2026 16:4420,169188,515,308166,401,0001,002,0002,371,584
3Apr 24, 2026 16:4420,169186,251,607166,407,0001,002,0002,367,488
4Apr 24, 2026 16:4420,171187,398,302166,418,0001,002,0002,363,392
5Apr 24, 2026 16:4420,196187,321,097165,637,0001,995,0002,375,680
6Apr 24, 2026 16:4420,893189,113,225172,411,0001,002,0002,363,392
7Apr 24, 2026 16:4420,905190,173,383171,520,0001,994,0002,310,144
8Apr 24, 2026 16:4420,906187,429,402173,526,00002,375,680
9Apr 24, 2026 16:4420,908187,978,970172,534,0001,003,0002,363,392