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 14, 2024 16:21Joad NacerJoad NacerScore: 4,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 16:214,43663,255,50234,830,0001,990,0002,408,448
2Oct 14, 2024 16:214,43862,265,89534,843,0001,991,0002,289,664
3Oct 14, 2024 16:214,44960,361,92133,936,0002,994,0002,281,472
4Oct 14, 2024 16:214,47263,092,32334,111,0003,009,0002,289,664
5Oct 14, 2024 16:214,52461,265,79235,517,0002,029,0002,400,256
6Oct 14, 2024 16:214,53763,766,13735,620,0002,035,0002,281,472