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 listDec 9, 2024 15:32virusegvirusegScore: 98,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 15:3298,816845,863,957764,164,00056,012,0002,289,664
2Dec 9, 2024 15:3298,921855,193,604761,041,00060,003,0002,285,568
3Dec 9, 2024 15:3298,941845,222,866761,197,00060,015,0002,535,424
4Dec 9, 2024 15:3298,972848,872,855764,502,00056,962,0002,523,136
5Dec 9, 2024 15:3298,995851,970,724764,684,00056,976,0002,301,952
6Dec 9, 2024 15:3298,997852,854,366764,696,00056,977,0002,535,424
7Dec 9, 2024 15:3299,122855,859,415766,733,00055,980,0002,301,952
8Dec 9, 2024 15:3299,227852,574,813763,611,00059,969,0002,306,048
9Dec 9, 2024 15:3299,274851,663,321767,977,00055,998,0002,310,144