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 listMay 10, 2026 11:22wnwnScore: 3,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:223,54845,038,31928,374,0001,075,0002,478,080
2May 10, 2026 11:223,55246,520,44828,365,0001,121,0002,478,080
3May 10, 2026 11:223,55548,546,10328,425,0001,085,0002,482,176
4May 10, 2026 11:223,55646,488,03128,456,0001,067,0002,486,272
5May 10, 2026 11:223,56045,220,86928,498,0001,051,0002,486,272
6May 10, 2026 11:223,56344,734,65128,501,0001,076,0002,482,176
7May 10, 2026 11:223,57446,572,47428,588,0001,080,0002,486,272
8May 10, 2026 11:223,58547,877,15928,671,0001,089,0002,494,464
9May 10, 2026 11:223,59847,134,86728,774,0001,094,0002,469,888