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 listFeb 24, 2026 13:31SneedSneedScore: 42,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 13:3142,488380,507,304351,648,000999,0002,285,568
2Feb 24, 2026 13:3142,493377,320,435350,696,0001,998,0002,285,568
3Feb 24, 2026 13:3142,502378,624,651351,766,000999,0002,285,568
4Feb 24, 2026 13:3142,515377,773,383350,877,0001,999,0002,285,568
5Feb 24, 2026 13:3142,522377,093,260350,931,0001,999,0002,285,568
6Feb 24, 2026 13:3142,608376,774,584352,646,000998,0002,285,568
7Feb 24, 2026 13:3142,608379,073,229351,652,0001,998,0002,265,088
8Feb 24, 2026 13:3142,609382,239,024351,653,0001,998,0002,371,584
9Feb 24, 2026 13:3142,611375,659,048351,671,0001,998,0002,285,568