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 28, 2026 13:54Dominique GarmierDominique GarmierScore: 52,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 13:5552,172451,042,373432,031,0001,000,0002,387,968
2Apr 28, 2026 13:5552,176452,694,707432,068,0001,000,0002,383,872
3Apr 28, 2026 13:5552,182452,185,147432,111,0001,000,0002,383,872
4Apr 28, 2026 13:5552,182450,563,411432,112,0001,000,0002,310,144
5Apr 28, 2026 13:5552,186447,252,075433,152,00002,310,144
6Apr 28, 2026 13:5552,188456,553,355432,167,0001,000,0002,326,528
7Apr 28, 2026 13:5552,198446,865,825432,249,0001,000,0002,453,504
8Apr 28, 2026 13:5553,060453,648,682439,405,0001,000,0002,318,336
9Apr 28, 2026 13:5553,075461,200,218438,527,0001,997,0002,379,776