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 23, 2025 21:17Alona MalohAlona MalohScore: 63,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 21:1763,770554,046,488442,244,00087,048,0002,285,568
2Apr 23, 2025 21:1763,789559,560,495453,526,00075,920,0002,277,376
3Apr 23, 2025 21:1763,830556,386,326438,824,00090,963,0002,285,568
4Apr 23, 2025 21:1763,831561,630,183449,825,00079,969,0002,289,664
5Apr 23, 2025 21:1763,945554,782,044459,775,00070,965,0002,285,568
6Apr 23, 2025 21:1764,047574,535,539446,653,00084,934,0002,285,568
7Apr 23, 2025 21:1764,064560,026,536464,765,00066,966,0002,285,568
8Apr 23, 2025 21:1764,092557,663,235452,969,00078,994,0002,277,376
9Apr 23, 2025 21:1764,335563,057,167445,985,00087,997,0002,285,568