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 listOct 9, 2024 02:24MikeMikeScore: 130,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 02:24129,9701,105,982,5611,014,765,00063,985,0002,330,624
2Oct 9, 2024 02:24129,9941,101,160,8221,021,950,00056,997,0002,465,792
3Oct 9, 2024 02:24130,0721,114,509,5091,015,623,00063,976,0002,330,624
4Oct 9, 2024 02:24130,0731,102,606,8571,022,627,00056,979,0002,330,624
5Oct 9, 2024 02:24130,0771,111,802,5601,014,660,00064,978,0002,465,792
6Oct 9, 2024 02:24130,1951,101,334,7231,024,642,00055,980,0002,330,624
7Oct 9, 2024 02:24130,2911,106,636,8021,019,453,00061,966,0002,465,792
8Oct 9, 2024 02:24130,3581,109,159,1671,021,970,00059,998,0002,326,528
9Oct 9, 2024 02:24130,3641,104,561,3131,025,022,00057,001,0002,326,528