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 9, 2025 10:40Advait IyerAdvait IyerScore: 1,826,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 10:401,823,90515,169,434,53815,075,442,00062,968,0002,277,376
2Jan 9, 2025 10:401,825,63515,188,171,56315,081,798,00070,970,0002,289,664
3Jan 9, 2025 10:401,826,42115,188,834,17815,077,328,00081,969,0002,277,376
4Jan 9, 2025 10:401,826,51915,195,809,71015,086,140,00073,966,0002,277,376
5Jan 9, 2025 10:401,826,85515,192,285,34215,083,933,00078,963,0002,265,088
6Jan 9, 2025 10:401,827,27315,197,965,16815,090,398,00075,966,0002,277,376
7Jan 9, 2025 10:401,830,38215,222,049,86215,120,202,00071,967,0002,289,664
8Jan 9, 2025 10:401,830,68315,224,187,23715,132,699,00061,974,0002,277,376
9Jan 9, 2025 10:401,882,36815,657,989,82815,541,694,00081,961,0002,277,376