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 listJan 21, 2025 02:01Gerard SmitGerard SmitScore: 91,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 02:0190,789780,498,912685,593,00067,959,0002,387,968
2Jan 21, 2025 02:0190,890780,469,117669,459,00084,931,0002,404,352
3Jan 21, 2025 02:0190,904783,914,078722,526,00031,979,0002,310,144
4Jan 21, 2025 02:0191,079782,534,704694,963,00060,996,0002,387,968
5Jan 21, 2025 02:0191,155784,683,350699,617,00056,968,0002,387,968
6Jan 21, 2025 02:0191,175782,514,488680,781,00075,975,0002,379,776
7Jan 21, 2025 02:0191,665790,315,182701,834,00058,986,0002,379,776
8Jan 21, 2025 02:0191,985790,273,976694,523,00068,952,0002,326,528
9Jan 21, 2025 02:0192,084794,669,392701,358,00062,942,0002,375,680