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 08:55TudyMTudyMScore: 35,880Success
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 08:5535,842317,199,095296,491,0001,001,0002,379,776
2Apr 28, 2026 08:5535,866313,326,211295,698,0001,997,0002,318,336
3Apr 28, 2026 08:5535,867316,093,356294,706,0002,997,0002,379,776
4Apr 28, 2026 08:5535,875314,496,376294,770,0002,997,0002,449,408
5Apr 28, 2026 08:5535,880316,810,132295,809,0001,998,0002,383,872
6Apr 28, 2026 08:5535,886312,639,325295,863,0001,999,0002,387,968
7Apr 28, 2026 08:5535,915311,863,555295,097,0003,000,0002,379,776
8Apr 28, 2026 08:5535,927315,301,176298,200,00002,383,872
9Apr 28, 2026 08:5535,936317,464,528297,271,0001,000,0002,445,312